Sciweavers

1633 search results - page 26 / 327
» Planar Map Graphs
Sort
View
ICALP
2009
Springer
16 years 2 days ago
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
SODA
2000
ACM
99views Algorithms» more  SODA 2000»
15 years 1 months ago
A point-placement strategy for conforming Delaunay tetrahedralization
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
Michael Murphy, David M. Mount, Carl W. Gable
SIAMDM
2008
101views more  SIAMDM 2008»
14 years 11 months ago
On Planar Quasi-Parity Graphs
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...
Cláudia Linhares Sales, Frédé...
EJC
2010
14 years 12 months ago
New bijective links on planar maps via orientations
This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific "transversal structures"...
Éric Fusy
CORR
2008
Springer
131views Education» more  CORR 2008»
14 years 12 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