6740 search results - page 293 / 1348 » An s -Hamiltonian Line Graph Problem |
124
click to vote
COMBINATORICS
2004
15 years 3 months ago
2004
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
126
click to vote
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
155
click to vote
LION
2009
Springer
15 years 10 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
123
Voted
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
136
click to vote
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...