Pages that link to "Item:Q1790989"
From MaRDI portal
The following pages link to Finding maximal common subgraphs via time-space efficient reverse search (Q1790989):
Displaying 7 items.
- Enumerating all connected maximal common subgraphs in two graphs (Q1589412) (← links)
- Observations from parallelising three maximum common (connected) subgraph algorithms (Q1626749) (← links)
- A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms (Q3627718) (← links)
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties (Q4631095) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
- Graph-Based Representations in Pattern Recognition (Q5316453) (← links)