Zobrazeno 1 - 10
of 18
pro vyhledávání: '"William Chung-Kung Yen"'
Publikováno v:
International Journal of Foundations of Computer Science. 33:141-148
In this paper, we introduce a new variant of domination called the outer-paired domination. For a graph [Formula: see text], an outer-paired dominating set [Formula: see text] is a dominating set of [Formula: see text] such that the induced subgraph
Autor:
William Chung-Kung Yen
Publikováno v:
Proceedings of The 17th International Symposium on Computer and Information Sciences ISBN: 9780429332821
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb79c0966e72d95c8ff75d90405e8fb2
https://doi.org/10.1201/9780429332821-29
https://doi.org/10.1201/9780429332821-29
Autor:
William Chung-Kung Yen
Publikováno v:
Theoretical Computer Science. 630:13-25
An undirected simple and connected graph is denoted by G ( V , E ) , where V and E are the vertex-set and the edge-set of G , respectively. For any subset S of V , 〈 S 〉 denotes the subgraph of G induced by S . A subset Q of V is a restrained dom
Publikováno v:
Optimization Letters. 10:1191-1201
In this paper, we study a variant of the p-median problem on block graphs G in which the p-median is asked to be connected, and this problem is called the connected p-median problem. We first show that the connected p-median problem is NP-hard on blo
Publikováno v:
Theoretical Computer Science. 570:15-21
A set H ? V is a hub set of a graph G = ( V , E ) if, for every pair of vertices u , v ? V ? H , either u is adjacent to v or there exists a path from u to v such that all intermediate vertices are in H. The hub number of G, denoted by h ( G ) , is t
Publikováno v:
The Computer Journal. 54:1838-1844
There are various ways to measure the shape difference between two n-node rooted binary trees (binary trees for short). A rotation on a binary tree is a local restructuring that changes the tree into another one preserving the in-order sequence. The
Publikováno v:
Theory of Computing Systems. 49:588-600
A set Q⊆V is a hub set of a graph G=(V,E) if, for every pair of vertices u,v∈V∖Q, there exists a path from u to v such that all intermediate vertices are in Q. The hub number of G is the minimum size of a hub set in G. This paper derives the hu
Autor:
William Chung-Kung Yen
Publikováno v:
The Computer Journal. 50:357-368
Autor:
William Chung-Kung Yen
Publikováno v:
Information Sciences. 157:199-215
Let G(V,E,W) denote a graph with vertex-set V and edge-set E, and each vertex v is associated with a cost W(v). For any set V' ⊆ V, the bottleneck cost of V' is defined as max{W(x)|x ∈ V'}. This paper considers the bottleneck independent dominati
Publikováno v:
Combinatorial Optimization and Applications ISBN: 9783642317699
COCOA
COCOA
The domatic number of a graph G, denoted by DN(G), is the maximum number k such that V can be partitioned into k disjoint dominating sets. The domatic partition problem is to find a partition of the vertices of G into DN(G) dominating sets. The k-dom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b15e068532dbd66bb15838daf22798d8
https://doi.org/10.1007/978-3-642-31770-5_22
https://doi.org/10.1007/978-3-642-31770-5_22