6740 search results - page 417 / 1348 » An s -Hamiltonian Line Graph Problem |
190
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...
165
click to vote
SIGECOM
2005
ACM
16 years 9 days ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
177
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
182
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
195
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
We investigate techniques for visualizing time series data and evaluate their effect in value comparison tasks. We compare line charts with horizon graphs--a space-efficient time ...