1729 search results - page 127 / 346 » On Bounds for the k-Partitioning of Graphs |
IPPS
2000
IEEE
15 years 2 months 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
14 years 11 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
14 years 10 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...
77
Voted
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph clas...
76
Voted
COCO
2007
Springer
15 years 4 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....