Cookies?
Library Header Image
LSE Research Online LSE Library Services

Constructive characterization theorems in combinatorial optimization

Kovács, Erika Renáta and Vegh, László ORCID: 0000-0003-1152-200X (2010) Constructive characterization theorems in combinatorial optimization. Rims Kôkyûroku Bessatsu, B23. pp. 147-169. ISSN 1881-6193

Full text not available from this repository.

Abstract

We give a survey on constructive characterization theorems and their applications in various fields of combinatorial optimization: edge- and vertex-connectivity problems, ear decompositions, and rigidity of graphs.

Item Type: Article
Official URL: http://ci.nii.ac.jp/organ/journal/INT1000000067_en...
Additional Information: © 2010 National Institute of Informatics
Divisions: Management
Subjects: Q Science > QA Mathematics
Date Deposited: 11 Oct 2012 12:32
Last Modified: 17 Oct 2021 23:09
URI: http://eprints.lse.ac.uk/id/eprint/45899

Actions (login required)

View Item View Item