On maximum degree-based ő≥-quasi-clique problem: Complexity and exact approaches.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/networks/PastukhovVBP18
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/networks/PastukhovVBP18
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Alexander_Veremyev
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Grigory_Pastukhov
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Oleg_A._Prokopyev
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Vladimir_Boginski
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1002%2Fnet.21791
>
foaf:
homepage
<
https://doi.org/10.1002/net.21791
>
dc:
identifier
DBLP journals/networks/PastukhovVBP18
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1002%2Fnet.21791
(xsd:string)
dcterms:
issued
2018
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/networks
>
rdfs:
label
On maximum degree-based ő≥-quasi-clique problem: Complexity and exact approaches.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Alexander_Veremyev
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Grigory_Pastukhov
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Oleg_A._Prokopyev
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Vladimir_Boginski
>
swrc:
number
2
(xsd:string)
swrc:
pages
136-152
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/networks/PastukhovVBP18/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/networks/PastukhovVBP18
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/networks/networks71.html#PastukhovVBP18
>
rdfs:
seeAlso
<
https://doi.org/10.1002/net.21791
>
dc:
title
On maximum degree-based ő≥-quasi-clique problem: Complexity and exact approaches.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
71
(xsd:string)