A fast longer path algorithm for routing grid with obstacles using biconnectivity based length upper bound.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/aspdac/KohiraST09
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/aspdac/KohiraST09
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Atsushi_Takahashi_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Suguru_Suehiro
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Yukihide_Kohira
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FASPDAC.2009.4796546
>
foaf:
homepage
<
https://doi.org/10.1109/ASPDAC.2009.4796546
>
dc:
identifier
DBLP conf/aspdac/KohiraST09
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FASPDAC.2009.4796546
(xsd:string)
dcterms:
issued
2009
(xsd:gYear)
rdfs:
label
A fast longer path algorithm for routing grid with obstacles using biconnectivity based length upper bound.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Atsushi_Takahashi_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Suguru_Suehiro
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Yukihide_Kohira
>
swrc:
pages
600-605
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/aspdac/2009
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/aspdac/KohiraST09/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/aspdac/KohiraST09
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/aspdac/aspdac2009.html#KohiraST09
>
rdfs:
seeAlso
<
https://doi.org/10.1109/ASPDAC.2009.4796546
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/aspdac
>
dc:
title
A fast longer path algorithm for routing grid with obstacles using biconnectivity based length upper bound.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document