Sciweavers

1105 search results - page 27 / 221
» Linear choosability of graphs
Sort
View
JCO
2010
56views more  JCO 2010»
14 years 8 months ago
Linear time construction of 5-phylogenetic roots for tree chordal graphs
William S. Kennedy, Hui Kong, Guohui Lin, Guiying ...
TCS
2010
14 years 8 months ago
Finding common structured patterns in linear graphs
Guillaume Fertin, Danny Hermelin, Romeo Rizzi, St&...
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
15 years 3 months ago
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
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...
Bilel Derbel, Cyril Gavoille, David Peleg
SPAA
2003
ACM
15 years 3 months ago
Optimal fault-tolerant linear arrays
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...
Toshinori Yamada, Shuichi Ueno