A note on the P-time algorithms for solving the maximum independent set problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/dmo/EsfahaniMMO09
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/dmo/EsfahaniMMO09
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Behnaz_Omoomi
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Kaveh_Mahdaviani
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Navid_Nasr_Esfahani
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Parisa_Mazrooei
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FDMO.2009.5341909
>
foaf:
homepage
<
https://doi.org/10.1109/DMO.2009.5341909
>
dc:
identifier
DBLP conf/dmo/EsfahaniMMO09
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FDMO.2009.5341909
(xsd:string)
dcterms:
issued
2009
(xsd:gYear)
rdfs:
label
A note on the P-time algorithms for solving the maximum independent set problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Behnaz_Omoomi
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Kaveh_Mahdaviani
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Navid_Nasr_Esfahani
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Parisa_Mazrooei
>
swrc:
pages
65-70
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/dmo/2009
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/dmo/EsfahaniMMO09/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/dmo/EsfahaniMMO09
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/dmo/dmo2009.html#EsfahaniMMO09
>
rdfs:
seeAlso
<
https://doi.org/10.1109/DMO.2009.5341909
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/dmo
>
dc:
title
A note on the P-time algorithms for solving the maximum independent set problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document