718 search results - page 92 / 144 » Coloring quasi-line graphs |
DISOPT
2010
14 years 12 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
124
click to vote
AVI
2006
15 years 1 months ago
2006
Scientific measurements are often depicted as line graphs. Stateof-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundred...
SPAA
2003
ACM
15 years 5 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
104
click to vote
RSA
2008
14 years 11 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...