Results 11 to 20 of about 367 (238)
A polynomial time algorithm for strong edge coloring of partial k-trees
Discrete Applied Mathematics, 2004 AbstractA matching M in a graph is called induced if there is no edge in the graph connecting two edges of M. The strong edge coloring problem is to find an edge coloring of a given graph with minimum number of colors such that each color class is an induced matching. This problem is known to be NP-complete, even in very restricted cases. Here, we show
Mohammad R. Salavatipour
openalex +3 more sources
Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees
Theoretical Computer Science, 2019 For a fixed number of colors, we show that, in node-weighted split graphs, cographs, and graphs of bounded tree-width, one can determine in polynomial time whether a proper list-coloring of the vertices of a graph such that the total weight of vertices of each color equals a given value in each part of a fixed partition of the vertices exists.
Cédric Bentz
openalex +6 more sources
An algorithm for solving minimum edge-ranking spanning tree problem on partial k-trees
Daffodil International University Journal of Science and Technology, 1970 An edge-ranking of a graph G is a labeling of its edges with positive integers such that every path between two edges with the same label i contains an intermediate edge with label j>i. The minimum edge-ranking spanning tree problem is to find a spanning tree of a graph G whose edge-ranking needs least number of ranks.
Sultana Razia
openalex +4 more sources
The game coloring number of pseudo partial k-trees
Discrete Mathematics, 2000 AbstractThis paper introduces a new class of graphs: (a,b)-pseudo partial k-trees. In some sense, the parameters (a,b) measure a graph's deviation from being a partial k-tree. In particular, a (0,0)-pseudo partial k-tree is just a partial k-tree. We discuss the game coloring number (as well as the game chromatic number) of (a,b)-pseudo partial k-trees,
Xuding Zhu
openalex +3 more sources
Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees [PDF]
Journal of Algorithms, 2002 We study graph multicoloring problems, motivated by the scheduling of dependent jobs on multiple machines. In multicoloring problems, vertices have lengths which determine the number of colors they must receive, and the desired coloring can be either contiguous (nonpreemptive schedule) or arbitrary (preemptive schedule).
Magnús M. Halldórsson, Guy Kortsarz
openalex +3 more sources
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics, 1989 AbstractWe present and illustrate by a sequence of examples an algorithm paradigm for solving NP- hard problems on graphs restricted to partial graphs of k-trees and given with an embedding in a k-tree. Such algorithms, linear in the size of the graph but exponential or superexponential in k, exist for most NP-hard problems that have linear time ...
Stefan Arnborg, Andrzej Proskurowski
openalex +2 more sources
Tree Risk Assessment Methods: A Comparison of Three Common Evaluation Forms
EDIS, 2014 All trees pose some level of risk to nearby people, structures, and utilities. As trees age or become weakened by pests, disease, and/or other stresses, a tree owner or manager may need to decide what risk level he or she is willing to accept and what ...
Andrew K. Koeser +3 more
doaj +5 more sources
Frontiers in Genetics, 2021 Accurate and fast characterization of the subtype sequences of Avian influenza A virus (AIAV) hemagglutinin (HA) and neuraminidase (NA) depends on expanding diagnostic services and is embedded in molecular epidemiological studies.
Fahad Humayun +8 more
doaj +1 more source
Frontiers in Plant Science, 2023 Soil acidification is very likely to affect the growth of tea trees and reduce tea yield. In this study, we analyzed the effects of soils with different pH on the physiological characteristics of tea leaves and determined the multi-element content and ...
Xiaoli Jia +10 more
doaj +1 more source
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence [PDF]
Logical Methods in Computer Science, 2019 It is well known that the length of a beta-reduction sequence of a simply typed lambda-term of order k can be huge; it is as large as k-fold exponential in the size of the lambda-term in the worst case.
Kazuyuki Asada +3 more
doaj +1 more source