1729 search results - page 128 / 346 » On Bounds for the k-Partitioning of Graphs |
93
Voted
FCT
2009
Springer
15 years 2 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
100
Voted
SIGCSE
2000
ACM
15 years 2 months ago
2000
ACM
Undergraduates are usually introduced to synchronization in operating systems through a discussion of classical problems such as reader-writer or producers-consumers. The traditio...
121
Voted
COCO
1997
Springer
15 years 2 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
92
Voted
FUN
2007
Springer
15 years 2 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...