Distribution-Free Connectivity Testing for Sparse Graphs

by Shirley Halevy, Eyal Kushilevitz

Published in Algorithmica by Springer Nature.

2007 Volume 51, p24-48

application/pdf 499.1 kB
file_6g53tqxv4zdxhmhlob74n4eoqm

"Dark" Preservation Only

Save Paper Now!

Know of a fulltext copy of on the public web? Submit a URL and we will archive it

Type article-journal
Stage

published

Date 2007-10-09
Language en ^?

DOI 10.1007/s00453-007-9054-1

Container Metadata
Not in DOAJ
In Keepers Registry
ISSN-L: 0178-4617

Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)

Cite This

BibTeX
CSL-JSON
MLA
Harvard

Lookup Links

oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar

Catalog Record
Revision: fdf052cd-020b-4dfb-b5ad-f2a10b204f60
API URL: JSON

Distribution-Free Connectivity Testing for Sparse Graphs release_7zgw2liiyzbr5jerpwktux6tfq