A New Polynomial-Time Algorithm for the Maximum Weighted (\chi(G) - 1)-Coloring Problem in Comparability Graphs.
Resource URI: http://dblp.l3s.de/d2r/resource/publications/journals/mst/Hertz94
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/mst/Hertz94
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Alain_Hertz
>
foaf:
homepage
<
http://dx.doi.org/10.1007%2FBF01192145
>
foaf:
homepage
<
http://dx.doi.org/10.1007/BF01192145
>
dc:
identifier
DBLP journals/mst/Hertz94
(xsd:string)
dc:
identifier
DOI 10.1007%2FBF01192145
(xsd:string)
dcterms:
issued
1994
(xsd:gYear)
swrc:
journal
<
http://dblp.l3s.de/d2r/resource/journals/mst
>
rdfs:
label
A New Polynomial-Time Algorithm for the Maximum Weighted (\chi(G) - 1)-Coloring Problem in Comparability Graphs.
(xsd:string)
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Alain_Hertz
>
swrc:
number
4
(xsd:string)
swrc:
pages
357-363
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/mst/Hertz94/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/mst/Hertz94
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/mst/mst27.html#Hertz94
>
rdfs:
seeAlso
<
http://dx.doi.org/10.1007/BF01192145
>
dc:
title
A New Polynomial-Time Algorithm for the Maximum Weighted (\chi(G) - 1)-Coloring Problem in Comparability Graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
27
(xsd:string)