2503 search results - page 187 / 501 » A study of 3-arc graphs |
160
click to vote
WINE
2005
Springer
16 years 2 days ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
155
click to vote
ADAEUROPE
2004
Springer
16 years 6 hour 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...
172
click to vote
ICCSA
2004
Springer
15 years 12 months ago
2004
Springer
Research involving different forms of networks, such as internet networks, social networks, and cellular networks, has increasingly become an important field of study. From this wo...
142
click to vote
STACS
2004
Springer
15 years 12 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
144
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...