Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Claire Pennarun"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 21 no. 4, Iss Graph Theory (2019)
Power domination in graphs emerged from the problem of monitoring an electrical system by placing as few measurement devices in the system as possible. It corresponds to a variant of domination that includes the possibility of propagation. For measur
Externí odkaz:
https://doaj.org/article/f266aa89794e4037a80e0bc90b97966f
The concept of power domination emerged from the problem of monitoring electrical systems. Given a graph G and a set $$S \subseteq V(G)$$ , a set M of monitored vertices is built as follows: at first, M contains only the vertices of S and their direc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a02ad50ba4ced0a56efe3ea5ea55124d
https://hal.archives-ouvertes.fr/hal-01814346/file/Power_dom_triangular_grids.pdf
https://hal.archives-ouvertes.fr/hal-01814346/file/Power_dom_triangular_grids.pdf
Publikováno v:
SODA
29th Annual ACM-SIAM Symposium on Discrete Algorithms
SODA: Symposium on Discrete Algorithms
SODA: Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.172-184, ⟨10.1137/1.9781611975031.12⟩
29th Annual ACM-SIAM Symposium on Discrete Algorithms
SODA: Symposium on Discrete Algorithms
SODA: Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.172-184, ⟨10.1137/1.9781611975031.12⟩
International audience; The ⌞-intersection graphs are the graphs that have a representation as intersection graphs of axis-parallel ⌞ shapes in the plane. A subfamily of these graphs are {⌞, |, –}-contact graphs which are the contact graphs o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8185cc27912844de5302189a950721b4
https://hal.archives-ouvertes.fr/hal-01569535
https://hal.archives-ouvertes.fr/hal-01569535
Publikováno v:
European Journal of Combinatorics
European Journal of Combinatorics, Elsevier, 2017, 65, pp.59-91
HAL
European Journal of Combinatorics, Elsevier, 2017, 65, pp.59-91
HAL
The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be a difficult one. To approach it, we define and count families o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::afc63996d86b6f5d2ddca7a237687370
https://hal.archives-ouvertes.fr/hal-01389264v2/file/eo_hal.pdf
https://hal.archives-ouvertes.fr/hal-01389264v2/file/eo_hal.pdf
Autor:
Claire Pennarun, Therese C. Biedl
A non-aligned drawing of a graph is a drawing where no two vertices are in the same row or column. Auber et al. showed that not all planar graphs have non-aligned drawings that are straight-line, planar, and in the minimal-possible $n\times n$-grid.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96f00cc26ed195221f697e9dc232faf9
http://arxiv.org/abs/1606.02220
http://arxiv.org/abs/1606.02220
Publikováno v:
HAL
23rd International Symposium on Graph Drawing and Network Visualization
23rd International Symposium on Graph Drawing and Network Visualization, Sep 2015, Los Angeles, United States
Lecture Notes in Computer Science ISBN: 9783319272603
Graph Drawing
23rd International Symposium on Graph Drawing and Network Visualization
23rd International Symposium on Graph Drawing and Network Visualization, Sep 2015, Los Angeles, United States
Lecture Notes in Computer Science ISBN: 9783319272603
Graph Drawing
International audience; Motivated by visualization of large graphs, we introduce a new type of graph drawing called ``rook-drawing".A \emph{rook-drawing} of a graph $G$ is obtained by placing the $n$ nodes of $G$ on the intersections of a regular gri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66f0b204cf1ce50309265672c5d2a8c1
https://hal.archives-ouvertes.fr/hal-01207960
https://hal.archives-ouvertes.fr/hal-01207960
Publikováno v:
HAL
Journal of Graph Algorithms and Applications
Journal of Graph Algorithms and Applications, Brown University, 2017, 21 (1), pp.103-120
Journal of Graph Algorithms and Applications
Journal of Graph Algorithms and Applications, Brown University, 2017, 21 (1), pp.103-120
International audience; We introduce a new type of graph drawing called " rook-drawing ". A rook-drawing of a graph G is obtained by placing the n nodes of G on the intersections of a regular grid, such that each row and column of the grid supports e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1aab8b467221413fa5beda472efd7e52
https://hal.archives-ouvertes.fr/hal-01431637
https://hal.archives-ouvertes.fr/hal-01431637