Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Jia-Jie Liu"'
Publikováno v:
Information Processing Letters. 115:917-922
The outer-connected domination problem is abbreviated as the OCD problem.The OCD problem was known to be linear-time solvable on proper interval graphs.We solve the OCD problem on interval graphs in linear-time.We do so by developing a chainless deco
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
Publikováno v:
Advances in Intelligent Systems and Applications-Volume 1 ISBN: 9783642354519
Let G = (V,E) be a simple graph with vertex set V and edge set E. A subset W ⊆ V ∪ E is a total covering set if every element x ∈ (V ∪ E) ∖ W is either adjacent to or incident to an element of W. The total covering problem is to find a tota
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4d31be0153da78df39d987fd48c3c59
https://doi.org/10.1007/978-3-642-35452-6_5
https://doi.org/10.1007/978-3-642-35452-6_5