Sciweavers

CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 3 months ago
Obfuscated Drawings of Planar Graphs
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
CORR
2008
Springer
131views Education» more  CORR 2008»
13 years 3 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy
CORR
2008
Springer
135views Education» more  CORR 2008»
13 years 3 months ago
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
Thomas Thierauf, Fabian Wagner
COMBINATORICA
2008
104views more  COMBINATORICA 2008»
13 years 3 months ago
Linearity of grid minors in treewidth with applications through bidimensionality
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an (w)
Erik D. Demaine, MohammadTaghi Hajiaghayi
ALGORITHMICA
2008
142views more  ALGORITHMICA 2008»
13 years 3 months ago
New Linear-Time Algorithms for Edge-Coloring Planar Graphs
We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...
Richard Cole, Lukasz Kowalik
GD
2008
Springer
13 years 4 months ago
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
J. Joseph Fowler, Carsten Gutwenger, Michael J&uum...
SODA
1990
ACM
114views Algorithms» more  SODA 1990»
13 years 4 months ago
Finding Steiner Forests in Planar Graphs
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
CCCG
2007
13 years 5 months ago
Homothetic Triangle Contact Representations of Planar Graphs
In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentra...
Melanie Badent, Carla Binucci, Emilio Di Giacomo, ...
APVIS
2007
13 years 5 months ago
Straight-line grid drawings of planar graphs with linear area
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...
Md. Rezaul Karim, Md. Saidur Rahman
COCOA
2008
Springer
13 years 5 months ago
Computational Study on Dominating Set Problem of Planar Graphs
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia