Fast enumeration algorithms for non-crossing geometric graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/compgeom/KatohT08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/compgeom/KatohT08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Naoki_Katoh
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Shin-ichi_Tanigawa
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1377676.1377733
>
foaf:
homepage
<
https://doi.org/10.1145/1377676.1377733
>
dc:
identifier
DBLP conf/compgeom/KatohT08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1377676.1377733
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
rdfs:
label
Fast enumeration algorithms for non-crossing geometric graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Naoki_Katoh
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Shin-ichi_Tanigawa
>
swrc:
pages
328-337
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/compgeom/2008
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/compgeom/KatohT08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/compgeom/KatohT08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/compgeom/compgeom2008.html#KatohT08
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1377676.1377733
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/compgeom
>
dc:
subject
enumeration, non-crossing geometric graphs, triangulation
(xsd:string)
dc:
title
Fast enumeration algorithms for non-crossing geometric graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document