Branch and cut algorithms for detecting critical nodes in undirected graphs

ISSN： 0926-6003

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Exploring Unknown Undirected Graphs

By Panaite P. Pelc A.

Journal of Algorithms, Vol. 33, Iss. 2, 1999-11 ,pp. : 281-295

Academic Press

Access to resources Recommend Favorite

Branch‐and‐cut and Branch‐and‐cut‐and‐price algorithms for the adjacent only quadratic minimum spanning tree problem

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 4, 2015-07 ,pp. : 367-379

John Wiley & Sons Inc

Access to resources Recommend Favorite

Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs

By Hota Mrinmoy Pal Madhumangal Pal Tapan K.

Computational Optimization and Applications, Vol. 27, Iss. 1, 2004-01 ,pp. : 95-113

Springer Publishing Company

Access to resources Recommend Favorite

Critical nodes for distance‐based connectivity and related problems in graphs

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 66, Iss. 3, 2015-10 ,pp. : 170-195

John Wiley & Sons Inc

Access to resources Recommend Favorite

Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time

By Weihe K.

Journal of Algorithms, Vol. 23, Iss. 1, 1997-04 ,pp. : 121-138

Academic Press

Access to resources Recommend Favorite