Results 81 to 90 of about 30,213,529 (145)

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

On the approximability of the maximum induced matching problem [PDF]

, 2005
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio <i>d</i>-1 for MIM in <i>d</i>-regular graphs, for each <i>d ...
Zito, Michele, David F. Manlovey, Zito, M., M. Zito, D. Manlove, Michele Zitoz, Duckworth, William, Manlove, D.F., W. Duckworth, Manlove, David F., Duckworth, W., William Duckworth, Manlove, David F   +12 more
core   +1 more source

3D Visibility Representations of 1-planar Graphs [PDF]

, 2018
We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parallel to the xy-plane, and the edges are unobstructed z-parallel visibilities between pairs of rectangles.
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann 0001, Fabrizio Montecchiani   +3 more
openaire   +4 more sources

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

Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes [PDF]

, 2005
The Maximum Independent Set problem in d-box graphs, i.e., in the intersection graphs of axis-parallel rectangles in R d , is a challenge open problem. For any fixed d ≥ 2 the problem is NP-hard and no approximation algorithm with ratio o(log d−1 n) is ...
Chlebikova, Janka, Miroslav Chlebík, Chlebik, Miroslav, Miroslav Chlebik (4461319), Janka Chlebíková, Janka Chlebíková (16060964)   +5 more
core  

Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]

, 2011
Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core  

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