1729 search results - page 33 / 346 » On Bounds for the k-Partitioning of Graphs |
137
click to vote
WG
2010
Springer
14 years 8 months ago
2010
Springer
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
ACTA
2006
14 years 10 months ago
2006
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
WDAG
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
102
click to vote
JCT
2008
14 years 9 months ago
2008
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...