725 search results - page 58 / 145 » Bounding Degrees on RPL |
114
click to vote
PODS
2005
ACM
16 years 25 days ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
WG
2005
Springer
15 years 6 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
APLAS
2010
ACM
15 years 28 days ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
103
click to vote
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
101
click to vote
EJC
2010
15 years 24 days ago
2010
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...