Pages that link to "Item:Q2543430"
From MaRDI portal
The following pages link to \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs (Q2543430):
Displaying 22 items.
- Asymmetrising sets in trees (Q1191926) (← links)
- Computer generation of vertex graphs (Q1222018) (← links)
- Canonical cactus representation for miminum cuts (Q1343494) (← links)
- Completeness results for graph isomorphism. (Q1401960) (← links)
- 3-connected reduction for regular graph covers (Q1663806) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- Construction of simple path graphs in transport networks. I: General solutions and examples (Q1995394) (← links)
- Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
- Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity (Q2239174) (← links)
- A V log V algorithm for isomorphism of triconnected planar graphs (Q2264677) (← links)
- New invariants for the graph isomorphism problem (Q2373963) (← links)
- Computing source-to-target shortest paths for complex networks in RDBMS (Q2402355) (← links)
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model (Q2418739) (← links)
- Jordan-like characterization of automorphism groups of planar graphs (Q2674344) (← links)
- Finding a Forest in a Tree (Q2811922) (← links)
- The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs (Q5028356) (← links)
- The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs (Q5092407) (← links)
- Marking algorithms (Q5671619) (← links)
- Graph theory (Q5917392) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- Block elimination distance (Q5918777) (← links)
- Block elimination distance (Q5925550) (← links)
