5889 search results - page 398 / 1178 » Graph Layout Problems |
186
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
144
click to vote
GLOBECOM
2006
IEEE
16 years 27 days ago
2006
IEEE
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
194
click to vote
MFCS
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
141
click to vote
COLT
2004
Springer
16 years 7 days ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
171
click to vote
STACS
2004
Springer
16 years 5 days ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...