O(n log²n) Time.">O(n log²n) Time., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"Perfect Matching for Biconnected Cubic Graphs in O(n ..."

Krzysztof Diks, Piotr Stanczyk (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-11266-9_27

access: closed

type: Conference or Workshop Paper

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sofsem/DiksS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sofsem/DiksS10
Krzysztof Diks, Piotr Stanczyk:
Perfect Matching for Biconnected Cubic Graphs in O(n log²n) Time. SOFSEM 2010: 321-333

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.