An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/mst/BeraPP03
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/mst/BeraPP03
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Debashis_Bera
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Madhumangal_Pal
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Tapan_Kumar_Pal
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs00224-002-1004-3
>
foaf:
homepage
<
https://doi.org/10.1007/s00224-002-1004-3
>
dc:
identifier
DBLP journals/mst/BeraPP03
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs00224-002-1004-3
(xsd:string)
dcterms:
issued
2003
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/mst
>
rdfs:
label
An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Debashis_Bera
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Madhumangal_Pal
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Tapan_Kumar_Pal
>
swrc:
number
1
(xsd:string)
swrc:
pages
17-27
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/mst/BeraPP03/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/mst/BeraPP03
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/mst/mst36.html#BeraPP03
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s00224-002-1004-3
>
dc:
title
An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
36
(xsd:string)