6740 search results - page 6 / 1348 » An s -Hamiltonian Line Graph Problem |
CCCG
2009
15 years 23 days ago
2009
The point placement problem is to determine the positions of a linear set of points, P = {p1, p2, p3, . . . , pn}, uniquely, up to translation and reflection, from the fewest poss...
106
click to vote
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
96
Voted
COCOA
2007
Springer
15 years 5 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
106
click to vote
CATS
2008
15 years 1 months ago
2008
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
AAAI
2004
15 years 1 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...