2283 search results - page 112 / 457 » Bounds of Graph Characteristics |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
WG
2005
Springer
14 years 1 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...
IPPS
2000
IEEE
14 years 13 days ago
2000
IEEE
This paper examines the task of constructing boundedtime self-stabilizing rule-based systems that take their input from an external environment. Bounded response-time and self-sta...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Given a graph G, an identifying code D V (G) is a vertex set such that for any two distinct vertices v1, v2 V (G), the sets N[v1] D and N[v2] D are distinct and nonempty (here...