Generating paths and cuts in multi-pole (di)graphs

Conference proceeding

Peer reviewed

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

Lecture notes in computer science, Vol.3153, pp.298-309

MFCS 2004 : mathematical foundations of computer science (Prague, 22-27 August 2004)

2004

Abstract

Algorithmics. Computability. Computer arithmetics

Applied sciences

Computer science; control theory; systems

Exact sciences and technology

Theoretical computing

11 Record Views

Title: Generating paths and cuts in multi-pole (di)graphs
Creators: Endre Boros - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ 08854-8003, United States
Khaled Elbassioni - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ 08854-8003, United States
Vladimir Gurvich - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway NJ 08854-8003, United States
Leonid Khachiyan - Department of Computer Science, Rutgers University, 110 Frelinghuysen Road, Piscataway NJ 08854-8003, United States
Kazuhisa Makino - Division of Systems Science, Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka, 560-8531, Japan
Publication Details: Lecture notes in computer science, Vol.3153, pp.298-309
Conference: MFCS 2004 : mathematical foundations of computer science (Prague, 22-27 August 2004)
Date published: 2004
Publisher: Springer
Academic Unit: Management Science and Information Systems (RBS)
Language: English
Resource Type: Conference proceeding
Identifiers: 991031664315304646