The following pages link to (Q3785974):
Displaying 19 items.
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- The Steiner forest problem revisited (Q972355) (← links)
- A parallelizable lexicographically first maximal edge-induced subgraph problem (Q1108808) (← links)
- Algorithms and outerplanar conditions for \(A\)-trails in plane Eulerian graphs (Q1392551) (← links)
- Metric dimension of maximal outerplanar graphs (Q2045286) (← links)
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs (Q2104935) (← links)
- Planar rectilinear drawings of outerplanar graphs in linear time (Q2123284) (← links)
- Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
- Polynomial time algorithm for min-ranks of graphs with simple tree structures (Q2258079) (← links)
- Weak Unit Disk and Interval Representation of Graphs (Q2827814) (← links)
- Characterizations of Deque and Queue Graphs (Q3104763) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
- Upward Partitioned Book Embeddings (Q4625113) (← links)
- Data Structures and their Planar Graph Layouts (Q4637665) (← links)
- Schematic Representation of Large Biconnected Graphs (Q4994348) (← links)
- Schematic Representation of Biconnected Graphs (Q5014113) (← links)
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets (Q5302049) (← links)
- Untangling circular drawings: algorithms and complexity (Q6101838) (← links)
- An improved algorithm for finding maximum outerplanar subgraphs (Q6184327) (← links)
