Results 201 to 210 of about 367 (238)
Some of the next articles are maybe not open access.
A linear algorithm for edge-coloring partial k-trees
1993Many combinatorial problems can be efficiently solved for partial k-trees. The edge-coloring problem is one of a few combinatorial problems for which no linear-time algorithm has been obtained for partial k-trees. The best known algorithm solves the problem for partial k-trees G in time \(O\left( {n\Delta ^{2^{2\left( {k + 1} \right)} } } \right ...
Shin-ichi Nakano+2 more
openaire +1 more source
Marking Games and the Oriented Game Chromatic Number of Partial k -Trees
Graphs and Combinatorics, 2003Nesetřil and Sopena introduced the concept of oriented game chromatic number. They asked whether the oriented game chromatic number of partial k-trees was bounded. Here we answer their question positively.
Hal A. Kierstead, Zsolt Tuza
openaire +2 more sources
Algorithms for finding f-colorings of partial k-trees
1995In an ordinary edge-coloring of a graph G=(V, E) each color appears at each vertex v ∈ V at most once. An f-coloring is a generalized edge-coloring in which each color appears at each vertex v ∈ V at most f(v) times, where f(v) is a positive integer assigned to v.
Takao Nishizeki, Xiao Zhou
openaire +2 more sources
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
1998Many combinatorial problems are NP-complete for general graphs, but are not NP-complete for partial k-trees (graphs of treewidth bounded by a constant k) and can be efficiently solved in polynomial time or mostly in linear time for partial k-trees.
Takao Nishizeki, Xiao Zhou
openaire +2 more sources
Mechanism of gating and partial agonist action in the glycine receptor
Cell, 2021Hongtao Zhu+2 more
exaly
Progress and controversies: Radiation therapy for invasive breast cancer
Ca-A Cancer Journal for Clinicians, 2014Reshma Jagsi
exaly
Brachytherapy: An overview for clinicians
Ca-A Cancer Journal for Clinicians, 2019Cyrus Chargari+2 more
exaly
Faster Algorithms for Subgraph Isomorphism of \sl k -Connected Partial \sl k -Trees
Anders Dessmark+2 more
openalex +1 more source
Definability Equals Recognizability of Partial 3-Trees and \sl k -Connected Partial \sl k -Trees
Damon Kaller
openalex +1 more source