Pages that link to "Item:Q1062457"
From MaRDI portal
The following pages link to An approach to the subgraph homeomorphism problem (Q1062457):
Displaying 25 items.
- Extending planar graph algorithms to \(K_{3,3}\)-free graphs (Q582121) (← links)
- A minimization version of a directed subgraph homeomorphism problem (Q1014308) (← links)
- The obstructions for toroidal graphs with no \(K_{3,3}\)'s (Q1025559) (← links)
- Structure and recognition of graphs with no 6-wheel subdivision (Q1031873) (← links)
- An exact algorithm for subgraph homeomorphism (Q1044032) (← links)
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597) (← links)
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
- A parallel algorithm for finding a triconnected component separator with an application (Q1339375) (← links)
- A large set of torus obstructions and how they were discovered (Q1700776) (← links)
- Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application. (Q1853125) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- On a conjecture of Tuza about packing and covering of triangles (Q1896363) (← links)
- Parallel complexity of partitioning a planar graph into vertex-induced forests (Q1923610) (← links)
- Efficient algorithms for acyclic colorings of graphs (Q1978502) (← links)
- Almost exact matchings (Q2429356) (← links)
- The structure of \(K_{3,3}\)-subdivision-free toroidal graphs (Q2462367) (← links)
- Some Tractable Win-Lose Games (Q3010417) (← links)
- Subgraph Homeomorphism via the Edge Addition Planarity Algorithm (Q3143746) (← links)
- Forbidden minors and subdivisions for toroidal graphs with no K3,3's (Q3439326) (← links)
- Searching for<i>K</i><sub>3,3</sub>in linear time (Q3978382) (← links)
- NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
- Revising the Fellows-Kaschube $K_{3,3}$ Search (Q5084691) (← links)
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (Q5896079) (← links)
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (Q5918671) (← links)
- NC algorithms for partitioning sparse graphs into induced forests with an application (Q6487991) (← links)
