MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop

Author, Editor
Author(s):
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa		dblp
dblp
dblp
dblp
dblp
dblp
Not MPG Author(s):
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Gurvich, Vladimir
Makino, Kazuhisa
Editor(s):
Azar, Yossi
Erlebach, Thomas		dblp
dblp
Not MPII Editor(s):
Azar, Yossi
Erlebach, Thomas
BibTeX cite key*:
Elbassioni2006f
Title, Booktitle
Title*:
Enumerating Spanning and Connected Subsets in Graphs and Matroids
Booktitle*:
Algorithms - ESA 2006, 14th Annual European Symposium
Event, URLs
Conference URL::
Downloading URL:
http://www.springerlink.com/content/k43q598n26gn7145/fulltext.pdf
Event Address*:
Zürich, Switzerland
Language:
English
Event Date*
(no longer used):
Organization:
Event Start Date:
11 September 2006
Event End Date:
13 September 2006
Publisher
Name*:
Springer
URL:
Address*:
Berlin, Germany
Type:
Vol, No, Year, pp.
Series:
Lecture Notes in Computer Science
Volume:
4168
Number:
Month:
Pages:
444-455
Year*:
2006
VG Wort Pages:
ISBN/ISSN:
978-3-540-38875-3
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
We show that enumerating all minimal spanning and connected subsets
of a given matroid can be solved in incremental quasi-polynomial
time. In the special case of graphical matroids, we improve this
complexity bound by showing that all minimal $2$-vertex connected
subgraphs of a given graph can be generated in incremental
polynomial time.
URL for the Abstract:
http://dx.doi.org/10.1007/11841036_41
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{Elbassioni2006f,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Borys, Konrad and Elbassioni, Khaled M. and Gurvich, Vladimir and Makino, Kazuhisa},
 EDITOR = {Azar, Yossi and Erlebach, Thomas},
 TITLE = {Enumerating Spanning and Connected Subsets in Graphs and Matroids},
 BOOKTITLE = {Algorithms - ESA 2006, 14th Annual European Symposium},
 PUBLISHER = {Springer},
 YEAR = {2006},
 VOLUME = {4168},
 PAGES = {444--455},
 SERIES = {Lecture Notes in Computer Science},
 ADDRESS = {Z{\"u}rich, Switzerland},
 ISBN = {978-3-540-38875-3},
}

Entry last modified by Christine Kiesel, 05/02/2007
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
12/27/2006 23:15:58
Revisions
4.
3.
2.
1.
0.		Editor(s)
Christine Kiesel
Khaled Elbassioni
Khaled Elbassioni
Christine Kiesel
Christine Kiesel		Edit Dates
02.05.2007 15:30:36
04/22/2007 01:16:33 PM
03/06/2007 05:34:18 PM
07.02.2007 14:54:29
12/27/2006 11:15:58 PM