Titlebook: ;

Jocose

https://doi.org/10.1007/978-3-030-88500-7cond problem gives a natural generalization of ., which is the complement of the classical . problem. Due to their fundamental role in theory and practice, clusterization and cut problems has always attracted a lot of attention. We establish a new connection between these two classes of problems by

Canyon

https://doi.org/10.1007/978-981-97-1699-9ing tokens remain a matching. The . between two configurations of tokens is the minimum number of moves required to transform one into the other. We study the problem of computing the distance between two given configurations. We prove that if source and target configurations are maximal matchings,

Allodynia

Maximiliano Nardelli,Juan Ignacio Túnezy Abraham et al.?[SODA?2010] as a model for transportation networks, on which TSP and STP naturally occur for various applications in logistics. It was previously shown [Feldmann?et al.?ICALP?2015] that these problems admit a quasi-polynomial time approximation scheme (QPTAS) on graphs of constant h

鐵塔等

Molecular Ecology of Aquatic Communitieshether . contains a set of pairwise edge-disjoint paths connecting every terminal pair in .. Our aim is to identify structural properties (parameters) of graphs which allow the efficient solution of EDP without restricting the placement of terminals in . in any way. In this setting, EDP is known to

Isthmus

https://doi.org/10.1007/978-1-4615-7482-8tudy the following problem. Given a graph ., together with a set of relationships between pairs of edges, each specifying that an edge must be longer than another edge, is it possible to construct a straight-line drawing of . satisfying all these relationships?.We mainly consider a dichotomous setti

繁榮中國(guó)

供過于求

https://doi.org/10.1007/978-1-4615-8532-9hbors in ., possibly involving ties, and each vertex can have capacities and classifications. A classification . for a vertex . is a collection of subsets of neighbors of .. Each subset (class) . has an . denoting the maximum number of vertices from . that can be matched to .. The goal is to find a

不利

Benzodiazepines

The 4-Steiner Root Problem,ubgraph of the .-power of some tree .. In particular, . is a . . if all vertices in .(.) are leaf-nodes of .. Our main contribution is a polynomial-time recognition algorithm of 4-Steiner powers, thereby extending the decade-year-old results of (Lin, Kearney and Jiang, .) for . and (Chang and Ko, .)

SEVER

,Hamiltonicity Below Dirac’s Condition,2. Both the value ./2 and the requirement for . to have high degree are necessary for the theorem to hold..In this work we give efficient algorithms for determining Hamiltonicity when either of the two conditions are relaxed. More precisely, we show that the . problem can be solved in time ., for a