2-Walks in 3-Connected Planar Graphs are Polynomial Time Computable

Local TagsRelease HistoryDetailsSummary

2-Walks in 3-Connected Planar Graphs are Polynomial Time Computable

Schmid, A. (2014). 2-Walks in 3-Connected Planar Graphs are Polynomial Time Computable. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0025-07A3-2 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0025-07A4-F

Genre: Thesis

show

show

hide

Creators:
Schmid, Andreas¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

show

show

hide

Language(s): eng - English

Dates: Accepted: 2014-01-31Date issued: 2014

Publication Status: Issued

Pages: IX, 35 p.

Publishing info: Saarbrücken : Universität des Saarlandes

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: SchmidMaster2014

Degree: Master

show

show

show

show