183 search results - page 22 / 37 » On the Matching Problem for Special Graph Classes |
110
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
109
click to vote
STACS
2010
Springer
15 years 8 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
115
click to vote
BMCBI
2006
15 years 1 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
NIPS
2004
15 years 2 months ago
2004
We propose a family of kernels based on the Binet-Cauchy theorem and its extension to Fredholm operators. This includes as special cases all currently known kernels derived from t...
124
click to vote
ALGORITHMICA
2010
15 years 1 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...