English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Certifying 3-Edge-Connectivity

Mehlhorn, K., Neumann, A., & Schmidt, J. M. (2013). Certifying 3-Edge-Connectivity. In A. Brandstädt, K. Jansen, & R. Reischuk (Eds.), Graph-theoretic Concepts in Computer Science (pp. 358-369). Berlin: Springer. doi:10.1007/978-3-642-45043-3_31.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Mehlhorn, Kurt1, Author           
Neumann, Adrian1, Author           
Schmidt, Jens M.1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20132013
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1007/978-3-642-45043-3_31
BibTex Citekey: Mehlhorn2013
 Degree: -

Event

show
hide
Title: 39th International Workshop on Graph-Theoretic Concepts in Computer Science
Place of Event: Lübeck, Germany
Start-/End Date: 2013-06-19 - 2013-06-21

Legal Case

show

Project information

show

Source 1

show
hide
Title: Graph-theoretic Concepts in Computer Science
  Abbreviation : WG 2013
  Subtitle : 39th International Workshop, WG 2013 ; Lübeck, Germany, June 19-21, 2013 ; Revised Papers
Source Genre: Proceedings
 Creator(s):
Brandstädt, Andreas1, Editor
Jansen, Klaus1, Editor
Reischuk, Rüdiger1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 358 - 369 Identifier: ISBN: 978-3-642-45042-6

Source 2

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