Pages that link to "Item:Q1144938"
From MaRDI portal
The following pages link to Linear algorithms to recognize outerplanar and maximal outerplanar graphs (Q1144938):
Displaying 41 items.
- Outer 1-planar graphs (Q289919) (← links)
- Max point-tolerance graphs (Q344833) (← links)
- Testing outerplanarity of bounded degree graphs (Q494925) (← links)
- On the order dimension of outerplanar maps (Q651434) (← links)
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
- A stronger lower bound on parametric minimum spanning trees (Q832875) (← links)
- Area-efficient planar straight-line drawings of outerplanar graphs (Q885284) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- The Steiner forest problem revisited (Q972355) (← links)
- The subgraph isomorphism problem for outerplanar graphs (Q1056237) (← links)
- A linear-time algorithm for isomorphism of a subclass of chordal graphs (Q1195864) (← links)
- Fast detection and display of symmetry in outerplanar graphs (Q1199463) (← links)
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time (Q1823708) (← links)
- Naturally submodular digraphs and forbidden digraph configurations (Q1962020) (← links)
- Maximum packing for biconnected outerplanar graphs (Q1962022) (← links)
- Metric dimension of maximal outerplanar graphs (Q2045286) (← links)
- The distance orientation problem (Q2091816) (← links)
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs (Q2104935) (← links)
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246) (← links)
- Planar rectilinear drawings of outerplanar graphs in linear time (Q2123284) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
- Conflict-free coloring bounds on open neighborhoods (Q2161000) (← links)
- A connected version of the graph coloring game (Q2192130) (← links)
- Bundled crossings revisited (Q2206831) (← links)
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← links)
- Two-page book embedding of trees under vertex-neighborhood constraints (Q2367407) (← links)
- Polynomial-time algorithms for special cases of the maximum confluent flow problem (Q2434729) (← links)
- A framework and algorithms for circular drawings of graphs (Q2465996) (← links)
- Heuristics for the maximum outerplanar subgraph problem (Q2573002) (← links)
- (Q2741364) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
- Schematic Representation of Large Biconnected Graphs (Q4994348) (← links)
- (Q5111885) (← links)
- Bundled Crossings Revisited (Q5141645) (← links)
- A stronger lower bound on parametric minimum spanning trees (Q6103526) (← links)
- Twisted ways to find plane structures in simple drawings of complete graphs (Q6145668) (← links)
- Uniquely colorable graphs up to automorphisms (Q6160596) (← links)
- An improved algorithm for finding maximum outerplanar subgraphs (Q6184327) (← links)
