English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Enumerating Spanning and Connected Subsets in Graphs and Matroids

Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V., & Makino, K. (2006). Enumerating Spanning and Connected Subsets in Graphs and Matroids. In Algorithms - ESA 2006, 14th Annual European Symposium (pp. 444-455). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-22B3-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-22B5-6
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Khachiyan, Leonid, Author
Boros, Endre, Author
Borys, Konrad, Author
Elbassioni, Khaled1, Author           
Gurvich, Vladimir, Author
Makino, Kazuhisa, Author
Azar, Yossi, Editor
Erlebach, Thomas, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

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

Details

show
hide
Language(s): eng - English
 Dates: 2007-04-222006
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 314460
Other: Local-ID: C1256428004B93B8-B1FD8FCBD7E4E89BC1257251007A4FDC-Elbassioni2006f
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Zürich, Switzerland
Start-/End Date: 2006-09-11

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithms - ESA 2006, 14th Annual European Symposium
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 444 - 455 Identifier: ISBN: 978-3-540-38875-3

Source 2

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