686 search results - page 66 / 138 » Packing Cycles in Graphs |
128
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
133
Voted
EMMCVPR
2007
Springer
15 years 9 months ago
2007
Springer
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasin...
119
click to vote
JCO
2006
15 years 3 months ago
2006
In this paper, we present a combinatorial theorem on labeling disjoint axis-parallel squares of edge length two using points. Given an arbitrary set of disjoint axis-parallel squar...
142
Voted
SIAMCOMP
2010
14 years 10 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
127
Voted
AUSAI
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...