Results 11 to 20 of about 818,578 (247)
A polynomial time algorithm for strong edge coloring of partial k-trees
Discrete Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammad R. Salavatipour
openalex +3 more sources
The game coloring number of pseudo partial k-trees
Discrete Mathematics, 2000 The author introduces the class of \((a,b)\)-pseudo partial \(k\)-trees, where the parameters \(a\) and \(b\) measure a graph's deviation from being a partial \(k\)-tree (the case \(a= b= 0\)). It is shown that the game coloring number of an \((a,b)\)-pseudo partial \(k\)-tree is at most \(3k+ 2a+ b+ 2\); for \(a= b= 0\), this greatly improves the ...
Xuding Zhu
openalex +3 more sources
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics, 1989 We present and illustrate by a sequence of examples an algorithm paradigm for solving NP-hard problems on graphs resticted 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 algorithms for ...
Stefan Arnborg, Andrzej Proskurowski
openalex +3 more sources
Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees [PDF]
Journal of Algorithms, 2002 In this paper, graph coloring problems are studied, where each vertex receives a set of specified size of colors. These sets can be contiguous, in which case the problem models nonpreemtive scheduling, or arbitrary, which models preemtive scheduling. Given a graph with specified for each vertex the number of colors one has to give it, the paper studies
Magnús M. Halldórsson, Guy Kortsarz
openalex +4 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
Data‐driven performance metrics for neural network learning
International Journal of Adaptive Control and Signal Processing, EarlyView., 2023 Summary Effectiveness of data‐driven neural learning in terms of both local mimima trapping and convergence rate is addressed. Such issues are investigated in a case study involving the training of one‐hidden‐layer feedforward neural networks with the extended Kalman filter, which reduces the search for the optimal network parameters to a state ...
Angelo Alessandri +2 more
wiley +1 more source
Uniqueness and minimal obstructions for tree-depth [PDF]
, 2015 A k-ranking of a graph G is a labeling of the vertices of G with values from {1,...,k} such that any path joining two vertices with the same label contains a vertex having a higher label.
Barrus, Michael D., Sinkovic, John
core +3 more sources
Succinct Partial Sums and Fenwick Trees [PDF]
, 2017 We consider the well-studied partial sums problem in succint space where one is to maintain an array of n k-bit integers subject to updates such that partial sums queries can be efficiently answered.
AC Yao +7 more
core +2 more sources
Trees, contraction groups, and Moufang sets [PDF]
, 2012 We study closed subgroups $G$ of the automorphism group of a locally finite tree $T$ acting doubly transitively on the boundary. We show that if the stabiliser of some end is metabelian, then there is a local field $k$ such that $\mathrm{PSL}_2(k) \leq G
De Medts, Pierre-emmanuel Caprace, Tom
core +3 more sources
Nucleon Decay Matrix Elements from Lattice QCD [PDF]
, 2001 We present a GUT-model-independent calculation of hadron matrix elements for all dimension-six operators associated with baryon number violating processes using lattice QCD.
Kuramashi, Yoshinobu
core +3 more sources