On the Steiner 2-edge connected subgraph polytope

E-ISSN： 1290-3868|42|3|259-283

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.42, Iss.3, 2008-08, pp. : 259-283

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

Polynomial time algorithms for two classes of subgraph problem

By Sridharan Sriraman

RAIRO - Operations Research, Vol. 42, Iss. 3, 2008-08 ,pp. : 291-298

Edp Sciences

Access to resources Recommend Favorite

Perfectly matchable subgraph problem on a bipartite graph

By Sharifov Firdovsi

RAIRO - Operations Research, Vol. 44, Iss. 1, 2010-02 ,pp. : 27-42

Edp Sciences

Access to resources Recommend Favorite

Book review: Frederick Steiner

Landscape Ecology, Vol. 19, Iss. 1, 2004-01 ,pp. : 114-116

Springer Publishing Company

Access to resources Recommend Favorite

The Polytope of m-Subspaces of a Finite Affine Space

By Christophe Julie Doignon Jean-Paul

RAIRO - Operations Research, Vol. 41, Iss. 3, 2007-08 ,pp. : 317-344

Edp Sciences

Access to resources Recommend Favorite

Absorption coefficients Part 2: Is "edge effect" more important than expected?

By Sauro Ron Vargas Michael Mange Gary

INTER-NOISE and NOISE-CON Congress and Conference Proceedings, Vol. 2009, Iss. 7, 2009-08 ,pp. : 369-378

Institute of Noise Control Engineering

Access to resources Recommend Favorite