On Strict (Outer-)Confluent Graphs
From MaRDI portal
Publication:5084690
DOI10.7155/jgaa.00568zbMath1490.68152OpenAlexW3201229745MaRDI QIDQ5084690
Martin Nöllenburg, Fabian Klute, Robert Ganian, Henry Förster
Publication date: 28 June 2022
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00568
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- Efficient parallel algorithms for doubly convex-bipartite graphs
- Trapezoid graphs and generalizations, geometry and algorithms
- A game of cops and robbers
- Confluent layered drawings
- Train tracks and confluent drawings
- Distance-hereditary graphs
- Trapezoid graphs and their coloring
- Hereditary modular graphs
- String graphs. I: The number of critical nonstring graphs is infinite
- Comparability graphs and intersection graphs
- Circle graph obstructions
- On the cop number of a graph
- Covering and coloring polygon-circle graphs
- Cops and robbers on intersection graphs
- Vertex-to-vertex pursuit in a graph
- Algorithmic graph theory and perfect graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Bundled crossings revisited
- Topology of series-parallel networks
- Bundled Crossings in Embedded Graphs
- The Bundled Crossing Number
- Strict Confluent Drawing
- Alternation Graphs
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
- Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
- Linear-time computability of combinatorial problems on series-parallel graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Computing Storyline Visualizations with Few Block Crossings
- Recognizing circle graphs in polynomial time
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- Block Crossings in Storyline Visualizations
- Transitiv orientierbare Graphen
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- More characterizations of triangulated graphs
- Confluent Hasse Diagrams
- Graph Drawing
