Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
From MaRDI portal
Publication:6575407
DOI10.1007/978-981-97-0566-5_25MaRDI QIDQ6575407FDOQ6575407
Authors: Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani 
Publication date: 19 July 2024
Cites Work
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- Lattice structures from planar graphs
- Rings of sets
- Reverse search for enumeration
- How to draw a planar graph on a grid
- Greedy drawings of triangulations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating Linear Extensions Fast
- Output-sensitive reporting of disjoint paths
- A linear-time algorithm for drawing a planar graph on a grid
- Schnyder woods and orthogonal surfaces
- Drawing planar graphs using the canonical ordering
- Generating all the acyclic orientations of an undirected graph
- Generating the Acyclic Orientations of a Graph
- Title not available (Why is that?)
- Topological sorting of large networks
- The computational complexity of knot and link problems
- On Triangle Contact Graphs
- Computing cartograms with optimal complexity
- On the minimum ropelength of knots and links
- Drawings of planar graphs with few slopes and segments
- Constructing plane spanners of bounded degree and low weight
- The number of Reidemeister moves needed for unknotting
- On topological aspects of orientations
- Succinct representation of labeled graphs
- An algorithm to generate the ideals of a partial order
- Gray codes from antimatroids
- Convex drawings of planar graphs and the order dimension of 3-polytopes
- Planar graphs, via well-orderly maps and trees
- Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
- Strictly convex drawings of planar graphs
- Decidability of string graphs
- Bipolar orientations revisited
- On the area requirements of planar greedy drawings of triconnected planar graphs
- Efficient algorithms on distributive lattices
- A polynomial bound for untangling geometric planar graphs
- Are there any good digraph width measures?
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
- On self-approaching and increasing-chord drawings of 3-connected planar graphs
- Efficient enumeration of graph orientations with sources
- Enumerating \(k\)-arc-connected orientations
- Morphing triangle contact representations of triangulations
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)
