Search Sciweavers | Sciweavers

156 search results - page 14 / 32

» Matched Drawings of Planar Graphs

click to vote

IWPEC
2009
Springer

99views Applied Computing» more IWPEC 2009»

Improved Induced Matchings in Sparse Graphs

14 years 1 months ago

Download faculty.cs.tamu.edu

An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...

Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Wal...

claim paper

Read More »

click to vote

ESA
2004
Springer

120views Algorithms» more ESA 2004»

Maximum Matchings in Planar Graphs via Gaussian Elimination

14 years 23 days ago

Download www.mimuw.edu.pl

We present a randomized algorithm for ﬁnding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...

Marcin Mucha, Piotr Sankowski

claim paper

Read More »

click to vote

ALGORITHMICA
2011

198views Artificial Intelligence» more ALGORITHMICA 2011»

Crossing Number and Weighted Crossing Number of Near-Planar Graphs

13 years 2 months ago

Download www.fmf.uni-lj.si

A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...

Sergio Cabello, Bojan Mohar

claim paper

Read More »

click to vote

ISAAC
2009
Springer

133views Algorithms» more ISAAC 2009»

Computing Large Matchings in Planar Graphs with Fixed Minimum Degree

14 years 1 months ago

Download i11www.iti.uni-karlsruhe.de

Robert Franke, Ignaz Rutter, Dorothea Wagner

claim paper

Read More »