Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
From MaRDI portal
(Redirected from Publication:6575407)
Cites work
- A linear-time algorithm for drawing a planar graph on a grid
- A polynomial bound for untangling geometric planar graphs
- An algorithm to generate the ideals of a partial order
- Are there any good digraph width measures?
- Bipolar orientations revisited
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
- Computing cartograms with optimal complexity
- Constructing plane spanners of bounded degree and low weight
- Convex drawings of planar graphs and the order dimension of 3-polytopes
- Decidability of string graphs
- Drawing planar graphs using the canonical ordering
- Drawings of planar graphs with few slopes and segments
- Efficient algorithms on distributive lattices
- Efficient enumeration of graph orientations with sources
- Enumerating \(k\)-arc-connected orientations
- Generating all the acyclic orientations of an undirected graph
- Generating Linear Extensions Fast
- Generating the Acyclic Orientations of a Graph
- Gray codes from antimatroids
- Greedy drawings of triangulations
- How to draw a planar graph on a grid
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 2123122 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- Lattice structures from planar graphs
- Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
- Morphing triangle contact representations of triangulations
- On self-approaching and increasing-chord drawings of 3-connected planar graphs
- On the area requirements of planar greedy drawings of triconnected planar graphs
- On the minimum ropelength of knots and links
- On topological aspects of orientations
- On Triangle Contact Graphs
- Output-sensitive reporting of disjoint paths
- Planar graphs, via well-orderly maps and trees
- Reverse search for enumeration
- Rings of sets
- Schnyder woods and orthogonal surfaces
- Strictly convex drawings of planar graphs
- Succinct representation of labeled graphs
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- The computational complexity of knot and link problems
- The number of Reidemeister moves needed for unknotting
- Topological sorting of large networks
Cited in
(2)
This page was built for publication: Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575407)
