Constructive characterization theorems in combinatorial optimization

Kovács, E. R. & Vegh, L.

(2010). Constructive characterization theorems in combinatorial optimization. Rims Kôkyûroku Bessatsu, B23, 147-169.

Copy

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
Copyright holders	© 2010 National Institute of Informatics
Departments	LSE > Academic Departments > Management
Date Deposited	11 Oct 2012
URI	https://researchonline.lse.ac.uk/id/eprint/45899

Explore Further

Végh, László A.

QA Mathematics

http://www.lse.ac.uk/Mathematics/people/Laszlo-Vegh.aspx (Author)
http://ci.nii.ac.jp/vol_issue/nels/AA12196120/ISS0000463340_en.html (Publisher)
http://ci.nii.ac.jp/organ/journal/INT1000000067_en... (Official URL)

Full text not available from this repository.

Downloads

View more statistics

Constructive characterization theorems in combinatorial optimization

Explore Further

Export as