scientific article; zbMATH DE number 4049084
From MaRDI portal
Publication:3785974
Recommendations
Cited in
(24)- A parallelizable lexicographically first maximal edge-induced subgraph problem
- Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs
- Metric dimension of maximal outerplanar graphs
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs
- Planar rectilinear drawings of outerplanar graphs in linear time
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- Recognizing generalized Petersen graphs in linear time
- Polynomial time algorithm for min-ranks of graphs with simple tree structures
- Weak unit disk and interval representation of graphs
- Recognizing outer 1-planar graphs in linear time
- Characterizations of deque and queue graphs
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Upward partitioned book embeddings
- Data Structures and their Planar Graph Layouts
- Schematic representation of large biconnected graphs
- Schematic Representation of Biconnected Graphs
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets
- Linear-time recognition of map graphs with outerplanar witness
- Untangling circular drawings: algorithms and complexity
- An improved algorithm for finding maximum outerplanar subgraphs
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Space-efficient biconnected components and recognition of outerplanar graphs
- Subsequences with generalised gap constraints: upper and lower complexity bounds
- The Steiner forest problem revisited
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3785974)
