Zobrazeno 1 - 10
of 217
pro vyhledávání: '"Vertex complexity"'
Akademický článek
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.
Autor:
Debnath Pal, Chandan Raychaudhury
Publikováno v:
Journal of Mathematical Chemistry. 58:887-892
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a8992b8fa13f3f6d7731c02b4c2d500
https://doi.org/10.1007/s10910-020-01118-1
https://doi.org/10.1007/s10910-020-01118-1
Autor:
JIANG, HAOTIAN1 jhtdavid@cs.washington.edu
Publikováno v:
Journal of the ACM. Feb2023, Vol. 70 Issue 1, p1-27. 27p.
Autor:
Liotta, Giuseppe1 (AUTHOR) giuseppe.liotta@unipg.it, Montecchiani, Fabrizio1 (AUTHOR) fabrizio.montecchiani@unipg.it, Tappini, Alessandra1 (AUTHOR) alessandra.tappini@studenti.unipg.it
Publikováno v:
Theoretical Computer Science. Apr2021, Vol. 863, p40-52. 13p.
Autor:
Di Giacomo, Emilio, Didimo, Walter, Evans, William S., Liotta, Giuseppe, Meijer, Henk, Montecchiani, Fabrizio, Wismath, Stephen K.
Publikováno v:
Algorithmica; Aug2018, Vol. 80 Issue 8, p2345-2383, 39p
Publikováno v:
Graph Drawing
Lecture Notes in Computer Science ISBN: 9783030044138
Lecture Notes in Computer Science ISBN: 9783030044138
An ortho-polygon visibility representation $\Gamma$ of a $1$-plane graph $G$ (OPVR of $G$) is an embedding preserving drawing that maps each vertex of $G$ to a distinct orthogonal polygon and each edge of $G$ to a vertical or horizontal visibility be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::307caf339846015ac559ec4b93990dcd
http://arxiv.org/abs/1807.01247
http://arxiv.org/abs/1807.01247
Autor:
Reneta P. Barneva, Valentin E. Brimkov
Publikováno v:
Theoretical Computer Science. 406(1-2):24-30
Let B^n be a hyperball in R^n, n>=2, and denote B"Z^n=B^[email protected]?Z^n. Define polyhedral facet complexity of B"Z^n as FC(B"Z^n)=min"P{f"n"-"1(P)} where P is an enclosing polyhedron for B"Z^n (i.e., P"[email protected]?Z^n=B"Z^n) and f"n"-"1(P
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::967ed3e50bc1b3ebd7ada0236d21a52d
Autor:
Di Giacomo, Emilio, Didimo, Walter, Evans, William S., Liotta, Giuseppe, Meijer, Henk, Montecchiani, Fabrizio, Wismath, Stephen K.
Publikováno v:
Graph Drawing & Network Visualization (9783319501055); 2016, p280-294, 15p
Autor:
Ancuceanu, Robert1 (AUTHOR) robert.ancuceanu@umfcd.ro, Popovici, Patriciu Constantin1 (AUTHOR) patriciu.popovici@drd.umfcd.ro, Drăgănescu, Doina2 (AUTHOR) nescu@umfcd.ro, Busnatu, Ștefan3,4 (AUTHOR) stefan.busnatu@umfcd.ro, Lascu, Beatrice Elena1 (AUTHOR) beatrice-elena.lascu@drd.umfcd.ro, Dinu, Mihaela1 (AUTHOR) mihaela.dinu@umfcd.ro
Publikováno v:
Pharmaceuticals (14248247). Nov2024, Vol. 17 Issue 11, p1448. 31p.
An ortho-polygon visibility representation $\Gamma$ of a $1$-plane graph $G$ (OPVR of $G$) is an embedding preserving drawing that maps each vertex of $G$ to a distinct orthogonal polygon and each edge of $G$ to a vertical or horizontal visibility be
Externí odkaz:
http://arxiv.org/abs/1807.01247