Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Orlando Lee"'
Autor:
Lucas I. B. Freitas, Orlando Lee
Publikováno v:
Open Journal of Discrete Mathematics. 12:29-46
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9e7309a70f980ef7c3634f34b0e8ea3
https://doi.org/10.4236/ojdm.2022.123003
https://doi.org/10.4236/ojdm.2022.123003
Publikováno v:
Discrete Mathematics. 346:113458
Let $D$ be a digraph. A stable set $S$ of $D$ and a path partition $\mathcal{P}$ of $D$ are orthogonal if every path $P \in \mathcal{P}$ contains exactly one vertex of $S$. In 1982, Berge defined the class of $α$-diperfect digraphs. A digraph $D$ is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::127f4f1950d2b6f13583abcf56f4446f
https://doi.org/10.1016/j.disc.2023.113458
https://doi.org/10.1016/j.disc.2023.113458
Publikováno v:
Graphs and Combinatorics. 37:2697-2701
The number $Z(n):=\lfloor n/2\rfloor\lfloor (n-1)/2\rfloor$ is the smallest number of crossings in a simple planar drawing of $K_{2,n}$ in which both vertices on the 2-side have the same clockwise rotation. For two vertices $u,v$ on the $q$-side of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7703e447bb11db1dc6108cb73c3a7216
https://doi.org/10.1007/s00373-021-02394-7
https://doi.org/10.1007/s00373-021-02394-7
Publikováno v:
Graphs and Combinatorics. 38
Let $D$ be a digraph. A subset $S$ of $V(D)$ is a stable set if every pair of vertices in $S$ is non-adjacent in $D$. A collection of disjoint paths $\mathcal{P}$ of $D$ is a path partition of $V(D)$, if every vertex in $V(D)$ is on a path of $\mathc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14c0f72ed6b8c6ac379b1f24afea0231
https://doi.org/10.1007/s00373-022-02509-8
https://doi.org/10.1007/s00373-022-02509-8
Publikováno v:
Procedia Computer Science. 195:5-11
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39f6904cf34dcb5b1686aac90ab827a0
https://doi.org/10.1016/j.procs.2021.11.005
https://doi.org/10.1016/j.procs.2021.11.005
Publikováno v:
Discrete Applied Mathematics. 281:172-194
In this paper we study some generalizations of the parking permit problem (Meyerson, FOCS’05), in which we are given a demand r t ∈ { 0 , 1 } for instant of time t = 0 , … , T − 1 , along with K permit types with lengths of time δ 1 , … ,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cbda3f4f9d109e56d26c0d892c456239
https://doi.org/10.1016/j.dam.2019.05.013
https://doi.org/10.1016/j.dam.2019.05.013
Publikováno v:
LATIN 2022: Theoretical Informatics ISBN: 9783031206238
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1543da3e7498c31010a8f5e65d581b6
https://doi.org/10.1007/978-3-031-20624-5_28
https://doi.org/10.1007/978-3-031-20624-5_28
Publikováno v:
Discrete Mathematics. 345:112941
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6efdd82a84be7b21318b5be34d64aa6e
https://doi.org/10.1016/j.disc.2022.112941
https://doi.org/10.1016/j.disc.2022.112941
Autor:
Orlando Lee
Publikováno v:
Biblioteca Digital de Teses e Dissertações da USP
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
Neste trabalho estudamos vários tipos de problemas envolvendo circuitos em grafos mistos. Tais grafos generalizam a noção de grafos orientados e não-orientados, no sentido de poderem conter tanto arcos como arestas. O seguinte problema é tratado
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04ea77ec11bc9910a860d9c428145e55
https://doi.org/10.11606/t.45.1999.tde-20210729-024308
https://doi.org/10.11606/t.45.1999.tde-20210729-024308
Publikováno v:
Anais do VI Encontro de Teoria da Computação (ETC 2021).
Let $k$ be a positive integer. A \emph{partial $k$-coloring} of a digraph $D$ is a set $\calC$ of $k$ disjoint stable sets and has \emph{weight} defined as $\sum_{C \in \calC} |C|$. An \emph{optimal} $k$-coloring is a $k$-coloring of maximum weight.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::adc533a1eace49650afc7ab8afd6f39e
https://doi.org/10.5753/etc.2021.16386
https://doi.org/10.5753/etc.2021.16386