Sciweavers

7 search results - page 1 / 2
» faw 2010
Sort
View
FAW
2010
Springer
205views Algorithms» more  FAW 2010»
13 years 4 months ago
Progress on Certifying Algorithms
Kurt Mehlhorn, Pascal Schweitzer
FAW
2010
Springer
238views Algorithms» more  FAW 2010»
13 years 2 months ago
Minimum Common String Partition Revisited
Haitao Jiang, Binhai Zhu, Daming Zhu, Hong Zhu
FAW
2010
Springer
217views Algorithms» more  FAW 2010»
13 years 2 months ago
Path Separability of Graphs
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several grap...
Emilie Diot, Cyril Gavoille
FAW
2010
Springer
225views Algorithms» more  FAW 2010»
13 years 4 months ago
Computing Minimum Diameter Color-Spanning Sets
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
Rudolf Fleischer, Xiaoming Xu
FAW
2010
Springer
232views Algorithms» more  FAW 2010»
13 years 5 months ago
Recognizing d-Interval Graphs and d-Track Interval Graphs
A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval...
Minghui Jiang