Pages that link to "Item:Q3637695"
From MaRDI portal
The following pages link to Efficient Suboptimal Graph Isomorphism (Q3637695):
Displaying 11 items.
- Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees (Q1578418) (← links)
- On the complexity of submap isomorphism and maximum common submap problems (Q1677051) (← links)
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time (Q1823708) (← links)
- (Q4408259) (← links)
- An algorithm using length-r paths to approximate subgraph isomorphism (Q4421027) (← links)
- (Q4536517) (← links)
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism (Q4575696) (← links)
- Benchmark Graphs for Practical Graph Isomorphism (Q5111749) (← links)
- Succinct Encodings of Graph Isomorphism (Q5404919) (← links)
- Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs (Q5410645) (← links)
- An Algorithm Portfolio for the Sub-graph Isomorphism Problem (Q5429292) (← links)