NP-completeness and degree restricted spanning trees. Discrete Mathematics 105 (1-3)(1992), 41-47.R. Douglas, "NP-Completeness and Degree Restricted Spanning Trees," Discrete Mathematics, vol. 105, 1992, pp. 41-47.R. Douglas, "Np-completeness and degree restricted spanning trees," Discrete ...
In this paper several results are proved: (1) Deciding whether a given planar graph G with maximum degree 3 has a spanning tree T , where deg( x , T ) = 1 or 3 for each node x , is NP-Complete. (2) For each proper subset S of the positive integers Z + with 1 S and | ...
Importantly, we derive NP-completeness results also for finding approximate embeddings, which may violate, e.g., capacity constraints by certain factors. Lastly, we prove that our results still pertain when restricting the request graphs to planar or degree-bounded graphs. 展开 ...
In this paper several results are proved: (1) Deciding whether a given planar graph G with maximum degree 3 has a spanning tree T, where deg(x, T) = 1 or 3... Robert,James,Douglas - 《Discrete Mathematics》 被引量: 64发表: 1992年 The NP-Completeness of the Dominating Set Problem ...
The problem of determining the chromatic index of a regular graph of fixed degree rges3 is known to be NP-complete. Several other restricted versions of the problem are NP-complete. The chromatic index problem restricted to regular comparability graphs of degree rges3, perfect graphs, regular lin...
Given only the degree sequences of n graphs g1, g2,…, gn, is there a 3-hypergraph G whose subsumed graphs G1, G2,…, Gn have the same degree sequences? We consider 3-hypergraphs with and without repeated edges. We prove these problems NP-complete. We indicate their relation to so...
Let $δ$ be a function from V into $\{$ 0,1$\}$ and let S(G,$δ)$ be the set of all realizations of the hypergraph G in which the degree of any vertex v has the same parity as $δ$ (u). The problem mentioned in the title is whether the set S(G,$δ)$ is nonempty....
remains NP-complete when restricted to the class of triangle-free graphs with maximum degree 4. Likewis... Frédéric,Maffray,and,... - 《Discrete Mathematics》 被引量: 235发表: 1996年 On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and ...
Compactness and Completeness of Fuzzy Normed Linear Space; 模糊赋范线性空间的紧性与完备性 2. Complete Algorithm of Quick Heuristic Attribute Reduction Based on Indiscernibility Degree 基于不可区分度的启发式快速完备约简算法 3. In order to probe into the properties of frequency spectrum for a gro...
NP-completenessBounded treewidthBounded degree graphsThe complexity of graph isomorphism (GRAPHISO) is a famous problem in computer science. For graphs G ... P Klavik,D Knop,P Zeman - 《Theoretical Computer Science》 被引量: 0发表: 2021年 Graph Isomorphism Restricted by Lists NP-completenessTh...