Related content

Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata

By Beame P.   Borodin A.   Raghavan P.   Ruzzo W.L.   Tompa M.  

Information and Computation, Vol. 130, Iss. 2, 1996-11 ,pp. : 101-129

Academic Press

Access to resources Recommend Favorite

Length two path-centred surface areas for the arrangement graph

By Cheng Eddie   Qiu Ke   Shen Zhizhang  

International Journal of Computer Mathematics, Vol. 91, Iss. 6, 2014-06 ,pp. : 1170-1189

Taylor & Francis Ltd

Access to resources Recommend Favorite

Branch and cut algorithms for detecting critical nodes in undirected graphs

By Di Summa Marco  

Computational Optimization and Applications, Vol. 53, Iss. 3, 2012-12 ,pp. : 649-680

Springer Publishing Company

Access to resources Recommend Favorite

The Fastest Path Between Two Points, with a Symmetric Obstacle

By Bell Kathleen   Polson Shania   Richmond Tom  

The College Mathematics Journal, Vol. 46, Iss. 2, 2015-03 ,pp. : 92-97

Mathematical Association of America

Access to resources Recommend Favorite

A new strategy for the undirected two-commodity maximum flow problem

By Sedeño-Noda A.   González-Martín C.   Alonso-Rodríguez S.  

Computational Optimization and Applications, Vol. 47, Iss. 2, 2010-10 ,pp. : 289-305

Springer Publishing Company

Access to resources Recommend Favorite