5100 search results - page 70 / 1020 » The Linear Complexity of a Graph |
TCS
2010
13 years 6 months ago
2010
CORR
2009
Springer
13 years 5 months ago
2009
Springer
SODA
2010
ACM
14 years 5 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
WDAG
2007
Springer
14 years 2 months ago
2007
Springer
The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n3/2 ) edge 3-spanner for it in O(log n) time. This algorithm is the...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k ve...