Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Ago Kuusik"'
Autor:
Ago Kuusik, Patrick Healy
Publikováno v:
Theoretical Computer Science. 320(2-3):331-344
In this paper we consider the problems of testing a multi-level graph for planarity and laying out or, drawing, a multi-level graph in a clear way. We introduce a new abstraction of a common integer linear programming formulation of the problems that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca7c40d08810829a6e7cccc73bb06a38
Publikováno v:
Discrete Mathematics. 280:51-63
We present a characterization of level planar graphs in terms of minimal forbidden subgraphs called minimal level non-planar (MLNP) subgraph patterns. We show that an MLNP subgraph pattern is completely characterized by either a tree, a level non-pla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2d64ebfec709bd71bc1b0f60b608086
https://doi.org/10.1016/j.disc.2003.02.001
https://doi.org/10.1016/j.disc.2003.02.001
Publikováno v:
Operations Research Letters. 24:73-80
In this paper we consider the problem of placing efficiently a rectangle in a two-dimensional layout that may not have the bottom-left placement property. This problem arises when we apply any one of a number of iterative improvement algorithms to th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::062d24d8dba36364a1b0572591a62ac0
https://doi.org/10.1016/s0167-6377(98)00048-0
https://doi.org/10.1016/s0167-6377(98)00048-0
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540677871
COCOON
COCOON
In this paper we give a characterization of level planar graphs in terms of minimal forbidden subgraphs called minimal level non-planar subgraph patterns (MLNP). We show that a MLNP is completely characterized by either a tree, a level non-planar cyc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5717484953ab4943e3c1960dd35316ba
https://doi.org/10.1007/3-540-44968-x_8
https://doi.org/10.1007/3-540-44968-x_8
Autor:
Patrick Healy, Ago Kuusik
Publikováno v:
Graph Drawing ISBN: 9783540669043
Graph Drawing
Graph Drawing
In this paper we consider the problems of testing a multi- level graph for planarity and laying out a multi-level graph.We introduce a new abstraction that we call a vertex-exchange graph. We demonstrate how this concept can be used to solve these pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14213e849da5a753ce9dc1b60d9cfb8a
https://doi.org/10.1007/3-540-46648-7_21
https://doi.org/10.1007/3-540-46648-7_21
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.