275 search results - page 44 / 55 » Bounding the Number of Edges in Permutation Graphs |
PODC
2011
ACM
12 years 10 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
COMGEO
2010
ACM
13 years 7 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
SPAA
2004
ACM
14 years 24 days ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
FUN
2010
Springer
14 years 5 days ago
2010
Springer
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
MCU
2004
13 years 8 months ago
2004
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...