Sciweavers

601 search results - page 42 / 121
» Edge-dominating cycles in graphs
Sort
View
WG
2010
Springer
15 years 4 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski
COMPGEOM
2010
ACM
15 years 11 months ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...
DCG
2007
83views more  DCG 2007»
15 years 6 months ago
The Genus of a Digital Image Boundary Is Determined by Its Foreground, Background, and Reeb Graphs
Weprovethatthegenusoftheboundaryofadigitalimageispreciselyhalfofthe sum of the cycle ranks of three particular graphs: the “foreground graph” and “background graph,” which ...
Lowell Abrams, Donniell E. Fishkind
COMBINATORICA
2011
14 years 6 months ago
A local criterion for Tverberg graphs
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
Alexander Engström
ICALP
2007
Springer
16 years 13 days ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber