Enumerating all connected maximal common subgraphs in two graphs
From MaRDI portal
Publication:1589412
DOI10.1016/S0304-3975(00)00286-3zbMATH Open0952.68105OpenAlexW2051658231MaRDI QIDQ1589412FDOQ1589412
Authors: R. Smith 
Publication date: 12 December 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00286-3
Recommendations
- Finding maximal common subgraphs via time-space efficient reverse search
- Computing and Combinatorics
- Graph-Based Representations in Pattern Recognition
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
- scientific article; zbMATH DE number 2090205
Cites Work
- Algorithm 457: finding all cliques of an undirected graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- On cliques in graphs
- Cliques of a graph-variations on the Bron-Kerbosch algorithm
- The Enumeration of Maximal Cliques of Large Graphs
- Finding a Maximum Clique in an Arbitrary Graph
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Finding a Maximum Independent Set
- A note on the derivation of maximal common subgraphs of two directed or undirected graphs
- A branch and bound algorithm for the maximum clique problem
- Clique detection for nondirected graphs: Two new algorithms
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
- A node covering algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (30)
- Reasoning on property graphs with graph generating dependencies
- Sampling-based box-covering algorithm for renormalization of networks
- Enumerating Isolated Cliques in Synthetic and Financial Networks
- A linear time algorithm for maximal clique enumeration in large sparse graphs
- Isolation concepts for clique enumeration: comparison and computational experiments
- Comparing and distinguishing the structure of biological branching
- A note on the problem of reporting maximal cliques
- Improved hardness of maximum common subgraph problems on labeled graphs of bounded treewidth and bounded degree
- Faster maximal clique enumeration in large real-world link streams
- Maximum common induced subgraph parameterized by vertex cover
- All roads lead to Rome -- new search methods for the optimal triangulation problem
- Maximal independent sets in clique-free graphs
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
- Communicability graph and community structures in complex networks
- A fast discovery algorithm for large common connected induced subgraphs
- Computing maximal cliques in link streams
- Refined pivot selection for maximal clique enumeration in graphs
- Finding maximal common subgraphs via time-space efficient reverse search
- The journey of graph kernels through two decades
- On the complexity of submap isomorphism and maximum common submap problems
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Enumerating all maximal biclusters in numerical datasets
- Graph-Based Representations in Pattern Recognition
- \textsc{Rime}: repeat identification
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
- Title not available (Why is that?)
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
- A shift-based model to solve the integrated staff rostering and task assignment problem with real-world requirements
- Efficiently enumerating all maximal cliques with bit-parallelism
- An algorithm for reporting maximal \(c\)-cliques
Uses Software
This page was built for publication: Enumerating all connected maximal common subgraphs in two graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589412)
