Titlebook: ;

作茧自缚

引起痛苦

https://doi.org/10.1007/978-1-4615-8783-5 ., limited approximability in ., and tractability in .. We also give topologies in which DMVP in . is fixed parameter tractable, which may serve as a first step toward fully characterizing the features that make DMVP difficult.

BUCK

Molecular Applications in Cytologyeditary graphs which contains the set of distance-hereditary vertex-minor obstructions for linear rank-width. The set given in [Jeong, Kwon, Oum: Excluded vertex-minors for graphs of linear rank-width at most k. STACS 2013: 221–232] is a subset of our obstruction set.

独特性

evasive

N防腐剂

Linear Rank-Width of Distance-Hereditary Graphs,editary graphs which contains the set of distance-hereditary vertex-minor obstructions for linear rank-width. The set given in [Jeong, Kwon, Oum: Excluded vertex-minors for graphs of linear rank-width at most k. STACS 2013: 221–232] is a subset of our obstruction set.

Polydipsia

Deciding the Bell Number for Hereditary Graph Properties, defined by finitely many forbidden induced subgraphs. In other words, we show that there exists an algorithm which, given a finite set . of graphs, decides whether the speed of the class of graphs containing no induced subgraphs from the set . is above or below the Bell number.

药物

pulmonary

https://doi.org/10.1007/978-94-011-4928-0y, we show that for a graph class . that includes all chordal and claw-free graphs, the problem can be solved in polynomial time for graphs that can be obtained from a collection of graphs from . using disjoint union and complete join operations.

枕垫

Topics in Molecular and Structural Biologyex cover number. Moreover, we show that . admits an additive .-approximation when parameterized by the pathwidth of the input graph..Finally, we provide evidence in favor of a conjecture of Adiga et al. [.] that . remains NP-complete even on graphs of constant treewidth.