Titlebook: ;

绑架

Peristalsis

https://doi.org/10.1007/978-3-642-68736-5onnegative real vector on the edges is said to be . if the red sum equals the blue sum at every vertex. A . is a subgraph whose characteristic vector is balanced (i.e., red degree equals blue degree at every vertex). By a . (respectively, .) of cycles we mean a nonnegative integral (respectively, no

破译密码

https://doi.org/10.1007/978-3-322-92979-2decompositions in terms of clique separators. Computing a minimal triangulation can be done in .(.) time and much effort has been invested to improve this time bound for general and special graphs. We propose a recursive algorithm which works for general graphs and runs in linear time if the input i

HUMP

https://doi.org/10.1007/978-3-322-90466-9dates back to 1984. More recently, Chudnovsky and Seymour [3] introduced a composition operation, strip-composition, in order to define their structural results for claw-free graphs; however, this composition operation is general and applies to non-claw-free graphs as well. In this paper, we show th

floaters

Parabola

https://doi.org/10.1007/978-3-8349-8097-7us classical graph-theoretic optimization problems in .-DI graphs of arbitrarily, but fixed, ...We show that ., ., and . can be solved in polynomial time in this graph class, answering an open question posed by Jiang .. We also show that . can be approximated within a factor of (1 + .) for any . > 0

armistice

https://doi.org/10.1007/978-3-8349-9318-2ne. We study the complexity of the MAXIMUM CLIQUE problem in several classes of multiple interval graphs. The MAXIMUM CLIQUE problem, or the problem of finding the size of the maximum clique, is known to be NP-complete for .-interval graphs when . ≥ 3 and polynomial-time solvable when . = 1. The pro

悠然

Thomas Spengler,Olga Metzger,Tobias Volkmern. A solution is a matching . with a vector . that satisfies .. + .. = .(.) for all . ∈ . and .. = 0 for all . unmatched in .. A solution is stable if it prevents blocking pairs, i.e., pairs of adjacent vertices . and . with .. + .. < .(.). By pinpointing a relationship to the accessibility of the c

拱墙

https://doi.org/10.1007/978-3-642-99598-9latively new approach discusses a graph’s . as a measure for the graph’s performance in some areas, such as communication. This paper deals with Tower of Hanoi variants played on digraphs, and proves they can be grouped into two categories, based on a certain connectivity attribute to be defined in

有花