Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/dam/AringhieriGHS19
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/dam/AringhieriGHS19
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Andrea_Grosso
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Pierre_Hosteins
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Roberto_Aringhieri
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Rosario_Scatamacchia
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.dam.2017.12.035
>
foaf:
homepage
<
https://doi.org/10.1016/j.dam.2017.12.035
>
dc:
identifier
DBLP journals/dam/AringhieriGHS19
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.dam.2017.12.035
(xsd:string)
dcterms:
issued
2019
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/dam
>
rdfs:
label
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Andrea_Grosso
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Pierre_Hosteins
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Roberto_Aringhieri
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Rosario_Scatamacchia
>
swrc:
pages
103-121
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/dam/AringhieriGHS19/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/dam/AringhieriGHS19
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/dam/dam253.html#AringhieriGHS19
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.dam.2017.12.035
>
dc:
title
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
253
(xsd:string)