Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/heuristics/KuntzPL06
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/heuristics/KuntzPL06
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Bruno_Pinaud
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Pascale_Kuntz
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/R%E2%88%9A%C2%A9mi_Lehn
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10732-006-4296-7
>
foaf:
homepage
<
https://doi.org/10.1007/s10732-006-4296-7
>
dc:
identifier
DBLP journals/heuristics/KuntzPL06
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10732-006-4296-7
(xsd:string)
dcterms:
issued
2006
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/heuristics
>
rdfs:
label
Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Bruno_Pinaud
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Pascale_Kuntz
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/R%E2%88%9A%C2%A9mi_Lehn
>
swrc:
number
1-2
(xsd:string)
swrc:
pages
23-36
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/heuristics/KuntzPL06/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/heuristics/KuntzPL06
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/heuristics/heuristics12.html#KuntzPL06
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10732-006-4296-7
>
dc:
subject
Graph drawing; Hierarchical digraph; Genetic algorithm; Metaheuristics
(xsd:string)
dc:
title
Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
12
(xsd:string)