Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa

dblp
dblp
dblp
dblp
dblp

Not MPG Author(s):

Boros, Endre
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa

Editor(s):

Fiala, Jirí
Koubek, Václav
Kratochvíl, Jan

dblp
dblp
dblp

Not MPII Editor(s):

Fiala, Jirí
Koubek, Václav
Kratochvíl, Jan

BibTeX cite key*:

Elbassioni2004b

Title, Booktitle

Title*:

Generating Paths and Cuts in Multi-pole (Di)graphs


MFCS04.pdf (229.58 KB)

Booktitle*:

Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

Prague, Czech Republic

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

22 August 2004

Event End Date:

27 August 2004

Publisher

Name*:

Springer

URL:


Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

3153

Number:


Month:

August

Pages:

298-309

Year*:

2004

VG Wort Pages:


ISBN/ISSN:

3-540-22823-3

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set of (source-sink) pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of . For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. For directed graphs both of these problems are NP-hard. We also give a polynomial delay algorithm for enumerating minimal sets of arcs connecting respectively two given nodes s1 and s2 to a given vertex t1, and each vertex of a given subset of vertices T2.



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Elbassioni2004b,
AUTHOR = {Boros, Endre and Elbassioni, Khaled M. and Gurvich, Vladimir and Khachiyan, Leonid and Makino, Kazuhisa},
EDITOR = {Fiala, Jir{\'i} and Koubek, V{\'a}clav and Kratochv{\'i}l, Jan},
TITLE = {Generating Paths and Cuts in Multi-pole (Di)graphs},
BOOKTITLE = {Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004},
PUBLISHER = {Springer},
YEAR = {2004},
VOLUME = {3153},
PAGES = {298--309},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Prague, Czech Republic},
MONTH = {August},
ISBN = {3-540-22823-3},
}


Entry last modified by Christine Kiesel, 05/02/2007
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Khaled Elbassioni
Created
02/22/2005 08:28:32 PM
Revisions
3.
2.
1.
0.
Editor(s)
Christine Kiesel
Christine Kiesel
Christine Kiesel
Khaled Elbassioni
Edit Dates
02.05.2007 15:39:40
26.04.2005 16:05:05
21.04.2005 16:08:53
02/22/2005 08:28:32 PM
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section

View attachments here:


File Attachment Icon
MFCS04.pdf