Tree Spanners for Bipartite Graphs and Probe Interval Graphs

By Brandstadt Andreas   Dragan Feodor F.   Le Hoang-Oanh   Le Van Bang   Uehara Ryuhei  

Algorithmica, Vol. 47, Iss. 1, 2007-01 ,pp. : 27-51

Springer Publishing Company

Access to resources Recommend Favorite

Improved Algorithms and Complexity Results for Power Domination in Graphs

By Guo Jiong   Niedermeier Rolf   Raible Daniel  

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 177-202

Springer Publishing Company

Access to resources Recommend Favorite

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms

By Chen J.   Kanj I.A.  

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 833-847

Elsevier

Access to resources Recommend Favorite

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

By Fernandez-Baca D.   Slutzki G.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 57-74

Elsevier

Access to resources Recommend Favorite

Optimal Distributed Algorithms in Unlabeled Tori and Chordal Rings

By Mans B.  

Journal of Parallel and Distributed Computing, Vol. 46, Iss. 1, 1997-10 ,pp. : 80-90

Academic Press

Access to resources Recommend Favorite