English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Generating Paths and Cuts in Multi-pole (Di)graphs

Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L., & Makino, K. (2004). Generating Paths and Cuts in Multi-pole (Di)graphs. In Mathematical foundations of computer science 2004: 29th International Symposium, MFCS 2004 (pp. 298-309). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2922-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2924-1
Genre: Conference Paper

Files

show Files
hide Files
:
MFCS04.pdf (Any fulltext), 230KB
 
File Permalink:
-
Name:
MFCS04.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Boros, Endre, Author
Elbassioni, Khaled1, Author           
Gurvich, Vladimir, Author
Khachiyan, Leonid, Author
Makino, Kazuhisa, Author
Fiala, Jirí, Editor
Koubek, Václav, Editor
Kratochvíl, Jan, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2005-04-262004
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 231180
Other: Local-ID: C1256428004B93B8-028218E7F7706A18C1256FB0006AFB8D-Elbassioni2004b
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Prague, Czech Republic
Start-/End Date: 2004-08-22

Legal Case

show

Project information

show

Source 1

show
hide
Title: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 298 - 309 Identifier: ISBN: 3-540-22823-3

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 3153 Sequence Number: - Start / End Page: - Identifier: -