Skip to main content
Conference Proceedings

A direct algorithm to find a largest common connected induced subgraph of two graphs

Lecture Notes in Computer Science (2005) 3434 162-171
DOI: 10.1007/978-3-540-31988-7_15
6Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connected induced subgraphs of the input graphs. Experimental results are provided. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Cuissart, B., & Hébrard, J. J. (2005). A direct algorithm to find a largest common connected induced subgraph of two graphs. In Lecture Notes in Computer Science (Vol. 3434, pp. 162–171). Springer Verlag. https://doi.org/10.1007/978-3-540-31988-7_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free