Sciweavers

686 search results - page 22 / 138
» Packing Cycles in Graphs
Sort
View
JGT
2008
150views more  JGT 2008»
14 years 9 months ago
Cycle spaces in topological spaces
: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...
Antoine Vella, R. Bruce Richter
77
Voted
COMPGEOM
2009
ACM
15 years 4 months ago
Minimum cuts and shortest homologous cycles
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...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
AISS
2010
161views more  AISS 2010»
14 years 7 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
DM
2007
57views more  DM 2007»
14 years 9 months ago
Triangulated neighborhoods in even-hole-free graphs
An even-hole-free graph is a graph that does not contain, as an induced subgraph, a chordless cycle of even length. A graph is triangulated if it does not contain any chordless cy...
Murilo Vicente Gonçalves da Silva, Kristina...
JACM
2007
115views more  JACM 2007»
14 years 9 months ago
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
Éric Colin de Verdière, Francis Laza...