Zobrazeno 1 - 10
of 90
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
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:
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:
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
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 1, Pp 5-26 (2018)
The strong chromatic index of a graph G, denoted by χ′s(G), is the minimum number of vertex induced matchings needed to partition the edge set of G. Let T be a tree without vertices of degree 2 and have at least one vertex of degree greater than 2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5dad7a93d88369d9fecd133d587b8dbc
https://doaj.org/article/e6879870e67448d89c6c560b08c0ae23
https://doaj.org/article/e6879870e67448d89c6c560b08c0ae23
Publikováno v:
Algorithmic Aspects in Information and Management ISBN: 9783030271947
AAIM
AAIM
In this paper, we consider the problem of constructing required subgraphs using stock pieces of fixed length (CRS-SPFL, for short), which is a variant of the problem of minimum-cost edge-weighted subgraph constructions (MCEWSC, for short). This new p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::785e1446ef09b9621c8abeaf9e0cdb60
https://doi.org/10.1007/978-3-030-27195-4_18
https://doi.org/10.1007/978-3-030-27195-4_18
Publikováno v:
Optimization Letters. 11:1663-1675
Given a weighted graph G on $$n + 1$$ vertices, a spanning K-tree $$T_K$$ of G is defined to be a spanning tree T of G together with K distinct edges of G that are not edges of T. The objective of the minimum-cost spanning K-tree problem is to choose
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5bac941c35a8d61dc97afad29d53647f
https://doi.org/10.1007/s11590-016-1078-5
https://doi.org/10.1007/s11590-016-1078-5