Pages that link to "Item:Q3790663"
From MaRDI portal
The following pages link to On the Complexity of Covering Vertices by Faces in a Planar Graph (Q3790663):
Displayed 23 items.
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (Q547303) (← links)
- On the complexity of embedding planar graphs to minimize certain distance measures (Q582079) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- Linear-time algorithms for problems on planar graphs with fixed disk dimension (Q845887) (← links)
- A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749) (← links)
- The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
- Efficient parallel algorithms for shortest paths in planar digraphs (Q1196454) (← links)
- On obstructions to small face covers in planar graphs (Q1204479) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Minimal connected enclosures on an embedded planar graph (Q1283782) (← links)
- 3-connected reduction for regular graph covers (Q1663806) (← links)
- Face covers and the genus problem for apex graphs (Q1850536) (← links)
- Jordan-like characterization of automorphism groups of planar graphs (Q2674344) (← links)
- Obstruction sets for outer-cylindrical graphs (Q2746484) (← links)
- Planar Embeddings with Small and Uniform Faces (Q2942666) (← links)
- Efficient distributed algorithms for single-source shortest paths and related problems on plane networks (Q4000864) (← links)
- Efficient parallel algorithms for shortest paths in planar graphs (Q5056111) (← links)
- Refined Vertex Sparsifiers of Planar Graphs (Q5208742) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- Splitting plane graphs to outerplanarity (Q6091165) (← links)
- Planarizing graphs and their drawings by vertex splitting (Q6172199) (← links)