Treffer: Linear-time algorithms for the 2-connected Steiner subgraph problem on special classes of graphs

Title:
Linear-time algorithms for the 2-connected Steiner subgraph problem on special classes of graphs
Source:
Networks (New York, NY). 23(3):195-206
Publisher Information:
New York, NY: John Wiley & Sons, 1993.
Publication Year:
1993
Physical Description:
print, 21 ref
Original Material:
INIST-CNRS
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Northwestern univ., dep. industrial eng. management sci., Evanston IL 60208, United States
ISSN:
0028-3045
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.4696419
Database:
PASCAL Archive