Zobrazeno 1 - 10
of 158
pro vyhledávání: '"Ko-Wei Lih"'
Autor:
Hsin-Hao Lai, Ko-Wei Lih
Publikováno v:
Discrete Applied Mathematics. 321:357-359
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1bc96da4a3b55a2ed3aca9ceeec549d5
https://doi.org/10.1016/j.dam.2022.07.010
https://doi.org/10.1016/j.dam.2022.07.010
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:
ZIYU HU1 azuth.hu@gmail.com, KO-WEI LIH2 makwlih@sinica.edu.tw, DAPHNE DER-FEN LIU3 dliu@calstatela.edu
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2018, Vol. 38 Issue 1, p5-26. 22p. 17 Diagrams.
Publikováno v:
SIAM Journal on Discrete Mathematics. 35:1729-1745
A 1-planar graph is a graph that can be drawn in the Euclidean plane such that each edge crosses at most one edge. An independent crossing (IC)-planar graph is a 1-planar graph satisfying the condi...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf4385eb383ad1ff03c89b4c70b9fa5d
https://doi.org/10.1137/20m133261x
https://doi.org/10.1137/20m133261x
Publikováno v:
Journal of Combinatorial Optimization. 44:1774-1795
In this paper, we address the problem of constructing required subgraphs using stock pieces of fixed length (CRS-SPFL, for short), which is a new variant of the minimum-cost edge-weighted subgraph (MCEWS, for short) problem. Concretely, for the MCEWS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cdc1502c37650cab6210e3a56a7122dc
https://doi.org/10.1007/s10878-020-00543-x
https://doi.org/10.1007/s10878-020-00543-x
Publikováno v:
Journal of Graph Theory. 95:99-124
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d428e39c9b876ef956b079059b236d67
https://doi.org/10.1002/jgt.22538
https://doi.org/10.1002/jgt.22538
Autor:
Kuo-Ching Huang, Ko-Wei Lih
Publikováno v:
European Journal of Combinatorics. 80:273-276
A factor (near-factor) of a finite simple graph G is a matching that saturates all vertices (except one). For m ⩾ 0 , a graph G is said to be m -critical ( m -near-critical) if the deletion of any m vertices from G produces a subgraph that has a fa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e405b757d076dd5f94b8fcb3066f7eaf
https://doi.org/10.1016/j.ejc.2018.02.017
https://doi.org/10.1016/j.ejc.2018.02.017
Autor:
R. E. Shafer
Publikováno v:
SIAM Review. 24:344-345
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::934c202316ac6c1d4824d37bc9a90b07
https://doi.org/10.1137/1024074
https://doi.org/10.1137/1024074
Publikováno v:
SIAM Journal on Discrete Mathematics; 2021, Vol. 35 Issue 3, p1729-1745, 17p
Publikováno v:
Information Processing Letters. 137:11-16
Motivated by the Steiner tree problem with minimum number of Steiner points and bounded edge-length in [4] , we consider the problem of constructing specific subgraph with minimum number of length-bounded stock pieces (CSS-MSP, for short), which is d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e532c9d4888b49928cfe2416b8199691
https://doi.org/10.1016/j.ipl.2018.04.013
https://doi.org/10.1016/j.ipl.2018.04.013