Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n."

Marek Cygan et al. (2014)

> Home

Details and statistics

DOI: 10.1007/S00453-013-9796-X

access: open

type: Journal Article

metadata version: 2021-07-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/CyganPPW14a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/CyganPPW14a
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n. Algorithmica 70(2): 195-207 (2014)

a service of

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.