"Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint ..."

Loukas Georgiadis (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-14165-2_62

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icalp/Georgiadis10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/Georgiadis10
Loukas Georgiadis:
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs. ICALP (1) 2010: 738-749

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.