Enumerating all connected maximal common subgraphs in two graphs
From MaRDI portal
Publication:1589412
DOI10.1016/S0304-3975(00)00286-3zbMath0952.68105OpenAlexW2051658231MaRDI QIDQ1589412
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
Related Items (25)
Communicability graph and community structures in complex networks ⋮ A linear time algorithm for maximal clique enumeration in large sparse graphs ⋮ All roads lead to Rome -- new search methods for the optimal triangulation problem ⋮ Efficiently enumerating all maximal cliques with bit-parallelism ⋮ The worst-case time complexity for generating all maximal cliques and computational experiments ⋮ On the complexity of submap isomorphism and maximum common submap problems ⋮ Maximal independent sets in clique-free graphs ⋮ A shift-based model to solve the integrated staff rostering and task assignment problem with real-world requirements ⋮ Computing maximal cliques in link streams ⋮ Refined pivot selection for maximal clique enumeration in graphs ⋮ The journey of graph kernels through two decades ⋮ Maximum common induced subgraph parameterized by vertex cover ⋮ Listing Maximal Subgraphs Satisfying Strongly Accessible Properties ⋮ \textsc{Rime}: repeat identification ⋮ A note on the problem of reporting maximal cliques ⋮ A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics ⋮ A fast discovery algorithm for large common connected induced subgraphs ⋮ Enumerating all maximal biclusters in numerical datasets ⋮ Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms ⋮ Sampling-based box-covering algorithm for renormalization of networks ⋮ Isolation concepts for clique enumeration: comparison and computational experiments ⋮ Enumerating Isolated Cliques in Synthetic and Financial Networks ⋮ Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree ⋮ Comparing and distinguishing the structure of biological branching ⋮ An algorithm for reporting maximal \(c\)-cliques
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clique detection for nondirected graphs: Two new algorithms
- A note on the derivation of maximal common subgraphs of two directed or undirected graphs
- Finding a Maximum Clique in an Arbitrary Graph
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
- Finding a Maximum Independent Set
- A node covering algorithm
- Cliques of a graph-variations on the Bron-Kerbosch algorithm
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- The Enumeration of Maximal Cliques of Large Graphs
- Algorithm 457: finding all cliques of an undirected graph
- A branch and bound algorithm for the maximum clique problem
- On cliques in graphs
This page was built for publication: Enumerating all connected maximal common subgraphs in two graphs
