Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Vida Dujmovic"'
Autor:
Carla Binucci, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini
Publikováno v:
IEEE Access, Vol 12, Pp 68828-68846 (2024)
Graph drawing beyond planarity is a research area that has received an increasing attention in the last twenty years, driven by the necessity to mitigate the visual complexity inherent in geometric representations of non-planar graphs. This research
Externí odkaz:
https://doaj.org/article/678bca8bfdb449b7bf54ecc84a394fb6
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Graph Theory (2022)
Layered treewidth and row treewidth are recently introduced graph parameters that have been key ingredients in the solution of several well-known open problems. It follows from the definitions that the layered treewidth of a graph is at most its row
Externí odkaz:
https://doaj.org/article/d23df7fef3614138ab44ebc16c748c5b
Publikováno v:
Monash University
We prove that for all integers $kgeq tgeq 0$ and $dgeq 2k$, every graph $G$ with treewidth at most $k$ has a `large' induced subgraph $H$, where $H$ has treewidth at most $t$ and every vertex in $H$ has degree at most $d$ in $G$. The order of $H$ dep
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19c2a5b0d45de2171265ccde6020ef83
Autor:
Vida Dujmovic, David R. Wood
Publikováno v:
Discrete & Computational Geometry; May2007, Vol. 37 Issue 4, p641-670, 30p
Autor:
Vida Dujmovic, Michael Fellows, Michael Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Fran Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
Publikováno v:
Algorithmica; Jun2006, Vol. 45 Issue 2, p159-182, 24p
Autor:
Vida Dujmovic, David Wood
Publikováno v:
Scopus-Elsevier
Monash University
Monash University
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::037f457d27659540b75d6f3c1bf260f4
http://www.scopus.com/inward/record.url?eid=2-s2.0-24344442753&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-24344442753&partnerID=MN8TOARS
Autor:
Vida Dujmovic, David Wood
Publikováno v:
Scopus-Elsevier
Monash University
Monash University
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0923c203000c8ee5cd3c4dd2700acea6
http://www.scopus.com/inward/record.url?eid=2-s2.0-80055061150&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-80055061150&partnerID=MN8TOARS
Autor:
Vida Dujmović, David R. Wood
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 13 no. 3, Iss Graph and Algorithms (2011)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/911712717c6a4180b81b06980fbb91b7
Autor:
Vida Dujmović, David R. Wood
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 7, Iss 1 (2005)
A k-stack layout (respectively, k-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering. A k-track layout of a graph consists
Externí odkaz:
https://doaj.org/article/9092fa64af8f4b5ebdae5fc413e1970b
Autor:
Vida Dujmović, David R. Wood
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 6, Iss 2 (2004)
In a total order of the vertices of a graph, two edges with no endpoint in common can be crossing, nested, or disjoint. A k-stack (respectively, k-queue, k-arch) layout of a graph consists of a total order of the vertices, and a partition of the edge
Externí odkaz:
https://doaj.org/article/f0644839adfd472faa5fff4dae01391d