An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/coap/BiancoDG97
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/coap/BiancoDG97
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Lucio_Bianco
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Paolo_Dell%27Olmo
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Stefano_Giordani
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1023%2FA%3A1008625405476
>
foaf:
homepage
<
https://doi.org/10.1023/A:1008625405476
>
dc:
identifier
DBLP journals/coap/BiancoDG97
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1023%2FA%3A1008625405476
(xsd:string)
dcterms:
issued
1997
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/coap
>
rdfs:
label
An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Lucio_Bianco
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Paolo_Dell%27Olmo
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Stefano_Giordani
>
swrc:
number
2
(xsd:string)
swrc:
pages
197-210
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/coap/BiancoDG97/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/coap/BiancoDG97
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/coap/coap8.html#BiancoDG97
>
rdfs:
seeAlso
<
https://doi.org/10.1023/A:1008625405476
>
dc:
title
An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
8
(xsd:string)