2079 search results - page 342 / 416 » Universality of random graphs |
139
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
149
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
131
click to vote
KBSE
2005
IEEE
15 years 9 months ago
2005
IEEE
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
137
click to vote
MSWIM
2005
ACM
15 years 9 months ago
2005
ACM
Topology Control (TC) is a well-studied technique used in wireless ad hoc networks to find energy-efficient and/or low-interference subgraphs of the maxpower communication graph....
118
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...