116 search results - page 18 / 24 » A Note on Cycle Lengths in Graphs |
EVOW
2008
Springer
13 years 9 months ago
2008
Springer
The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, r...
CIAC
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n−2 edges and an additive 3-spanner with at most O...
DMGT
2011
12 years 11 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
SWAT
2010
Springer
14 years 18 days ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
NIPS
2003
13 years 9 months ago
2003
This paper presents a novel graph-theoretic approach, named ratio contour, to extract perceptually salient boundaries from a set of noisy boundary fragments detected in real image...