Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract).
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/CheriyanT96
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/CheriyanT96
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Joseph_Cheriyan
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ramakrishna_Thurimella
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1996.548488
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1996.548488
>
dc:
identifier
DBLP conf/focs/CheriyanT96
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1996.548488
(xsd:string)
dcterms:
issued
1996
(xsd:gYear)
rdfs:
label
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract).
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Joseph_Cheriyan
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ramakrishna_Thurimella
>
swrc:
pages
292-301
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/1996
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/CheriyanT96/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/CheriyanT96
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs96.html#CheriyanT96
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1996.548488
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
graph theory; minimum-size; k-connected spanning subgraphs; matching; k-NCSS; k-ECSS; undirected graphs; heuristic
(xsd:string)
dc:
title
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract).
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document