1729 search results - page 252 / 346 » Bound Graph Polysemy |
155
click to vote
ICDCS
2009
IEEE
16 years 3 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
162
click to vote
FOCS
2006
IEEE
16 years 2 days ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
151
click to vote
IPPS
2006
IEEE
16 years 1 days ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
149
click to vote
ADAEUROPE
2004
Springer
15 years 11 months ago
2004
Springer
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
142
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...