Titlebook: Combinatorial Algorithms; 25th International W Kratochvíl Jan,Mirka Miller,Dalibor Froncek Conference proceedings 2015 Springer Internation

grandiose

積習(xí)已深

Computing Primitively-Rooted Squares and Runs in Partial Words,rings that cannot be extended further to the left or right. We show how to compute all the primitively-rooted squares in a given partial word, which is a sequence that may have undefined positions, called holes or wildcards, that match any letter of the alphabet over which the sequence is defined. W

表示向下

剝皮

態(tài)學(xué)

Solving Matching Problems Efficiently in Bipartite Graphs,respectively, the number of vertices and the number of edges. We solve maxDMM for bipartite graphs, by providing an .-time algorithm. We design better algorithms for complete bipartite graphs, and . graphs. (Bisplit graphs are bipartite graphs with the nested neighborhood property.) Specifically, we

botany

狂熱文化

Reconfiguration of Vertex Covers in a Graph,ere exists a sequence of vertex covers of . which transforms . into . such that each vertex cover in the sequence is of cardinality at most . and is obtained from the previous one by either adding or deleting exactly one vertex. This problem is PSPACE-complete even for planar graphs. In this paper,

歪曲道理

Enzyme

Femish

Profile-Based Optimal Matchings in the Student/Project Allocation Problem, order of preference. Each student can be assigned to at most one project and there are constraints on the maximum number of students that can be assigned to each project and lecturer. We seek matchings of students to projects that are optimal with respect to ., which is a vector whose .th component