ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

Journal article

Open access

ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(the 50th Anniversary of the Operations Research Society of Japan)

Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni, Vladimir Gurvich and Kazuhisa Makino

Journal of the Operations Research Society of Japan, Vol.50(4), pp.325-338

2007

url

https://doi.org/10.15807/jorsj.50.325View

Version of Record (VoR) Open

3 Record Views

Title: ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(the 50th Anniversary of the Operations Research Society of Japan)
Creators: Leonid Khachiyan
Endre Boros - Rutgers University
Konrad Borys - Rutgers University
Khaled Elbassioni - Max-Planck-Institut fur Informatik
Vladimir Gurvich - Rutgers University
Kazuhisa Makino - University of Tokyo
Publication Details: Journal of the Operations Research Society of Japan, Vol.50(4), pp.325-338
Date published: 2007
Academic Unit: Management Science and Information Systems (RBS)
Language: English
Resource Type: Journal article
Identifiers: 991031665035704646