Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/alenex/GeorgiadisIKPP18
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/alenex/GeorgiadisIKPP18
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Aikaterini_Karanasiou
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Giuseppe_F._Italiano
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Loukas_Georgiadis
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nikos_Parotsidis
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nilakantha_Paudel
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1137%2F1.9781611975055.15
>
foaf:
homepage
<
https://doi.org/10.1137/1.9781611975055.15
>
dc:
identifier
DBLP conf/alenex/GeorgiadisIKPP18
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1137%2F1.9781611975055.15
(xsd:string)
dcterms:
issued
2018
(xsd:gYear)
rdfs:
label
Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Aikaterini_Karanasiou
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Giuseppe_F._Italiano
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Loukas_Georgiadis
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nikos_Parotsidis
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nilakantha_Paudel
>
swrc:
pages
169-183
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/alenex/2018
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/alenex/GeorgiadisIKPP18/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/alenex/GeorgiadisIKPP18
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/alenex/alenex2018.html#GeorgiadisIKPP18
>
rdfs:
seeAlso
<
https://doi.org/10.1137/1.9781611975055.15
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/alenex
>
dc:
title
Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document