Pages that link to "Item:Q3627718"
From MaRDI portal
The following pages link to Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms (Q3627718):
Displaying 7 items.
- Enumerating all connected maximal common subgraphs in two graphs (Q1589412) (← links)
- Finding maximal common subgraphs via time-space efficient reverse search (Q1790989) (← links)
- A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
- Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues (Q2657102) (← links)
- (Q5005670) (← links)
- Combinatorial Pattern Matching (Q5315344) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)