1729 search results - page 189 / 346 » Bound Graph Polysemy |
160
click to vote
SIGECOM
2005
ACM
15 years 12 months 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...
175
click to vote
ESA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
158
click to vote
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
181
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
164
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...