AAAI
2004
13 years 6 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...
ICCS
2007
Springer
13 years 8 months ago
2007
Springer
1 A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton2 path (a path including every vertex of G); and G is s-hamiltonian-connected if the del...
ISPAN
2008
IEEE
13 years 11 months ago
2008
IEEE
Intuitively, a signed graph is a graph in which every edge is labeled with a + or − sign. For each edge, its sign represents the mode of the relationship between the vertices it...