6740 search results - page 979 / 1348 » An s -Hamiltonian Line Graph Problem |
159
click to vote
SAS
2004
Springer
16 years 6 days ago
2004
Springer
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
138
click to vote
FOCS
2003
IEEE
16 years 4 days ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
173
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
175
click to vote
PODC
2009
ACM
15 years 11 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
168
click to vote
CPM
2001
Springer
15 years 11 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...