Results 61 to 70 of about 17,567 (164)

Upward Embeddings and Orientations of Undirected Planar Graphs

Journal of Graph Algorithms and Applications, 2003
An upward embedding of an embedded planar graph specifies, for each vertex v, which edges are incident on v "above" or "below" and, in turn, induces an upward orientation of the edges from bottom to top.
Walter Didimo, Maurizio Pizzonia
doaj   +1 more source

Heuristics for Exact 1-Planarity Testing

Journal of Graph Algorithms and Applications
Since many real-world graphs are nonplanar, the study of graphs that allow few crossings per edge has been an active subfield of graph theory in recent years.
Miriam Münch, Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter   +3 more
doaj   +1 more source

Minimal non-1-planar graphs

Discrete Mathematics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Min-$k$-planar Drawings of Graphs

Journal of Graph Algorithms and Applications
The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing.
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmović, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini   +9 more
doaj   +1 more source

Beyond Outerplanarity

Computing in Geometry and Topology
We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with convex drawings: outer $k$-planar graphs, where each edge is crossed by at ...
Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff   +4 more
doaj   +1 more source

OOPS: Optimized One-Planarity Solver via SAT

Journal of Graph Algorithms and Applications
We present OOPS (Optimized One-Planarity Solver), a practical heuristic for recognizing 1-planar graphs and several important subclasses. A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once---a natural ...
Sergey Pupyrev
doaj   +1 more source

NP-completeness of the Planar Separator Problems

Journal of Graph Algorithms and Applications, 2006
For a given graph G, the Separator Problem asks whether a vertex or edge set of small cardinality (or weight) exists whose removal partitions G into two disjoint graphs of approximately equal sizes.
Junichiro Fukuyama
doaj   +1 more source

Planar Graphs with Topological Constraints

Journal of Graph Algorithms and Applications, 2002
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cycle of the given graph and a set of its edges to be embedded inside this ...
Christoph Dornheim
doaj   +1 more source

On the Synthesis of Planar Graphs with Given Properties

Кібернетика та комп'ютерні технології
The problem of studying the structural properties of planar subgraphs G\v, where v is an arbitrary vertex of a graph G of undirected genus, is considered, using cell chains that connect limit cycles with points of a given set M of the graph G\v.
Volodymyr Petrenjuk, Dmytro Petreniuk
doaj   +1 more source

On 1-Planar Graphs with Bounded Cop-Number

Theoretical Computer Science
Cops and Robbers is a type of pursuit-evasion game played on a graph where a set of cops try to capture a single robber. The cops first choose their initial vertex positions, and later the robber chooses a vertex. The cops and robbers make their moves in alternate turns: in the cops' turn, every cop can either choose to move to an adjacent vertex or ...
Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Karthik Murali 0001   +3 more
openaire   +3 more sources