An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/ACMse/Kundu82
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/ACMse/Kundu82
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sukhamay_Kundu
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F503896.503902
>
foaf:
homepage
<
https://doi.org/10.1145/503896.503902
>
dc:
identifier
DBLP conf/ACMse/Kundu82
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F503896.503902
(xsd:string)
dcterms:
issued
1982
(xsd:gYear)
rdfs:
label
An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sukhamay_Kundu
>
swrc:
pages
29
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/ACMse/1982
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/ACMse/Kundu82/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/ACMse/Kundu82
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/ACMse/ACMse1982.html#Kundu82
>
rdfs:
seeAlso
<
https://doi.org/10.1145/503896.503902
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/ACMse
>
dc:
subject
algorithm, depth-first search, planar digraph, transitive reduction
(xsd:string)
dc:
title
An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document