Titlebook: Combinatorial Algorithms; 22th International W Costas S. Iliopoulos,William F. Smyth Conference proceedings 2011 Springer-Verlag GmbH Berli

指派

Complexity of Cycle Transverse Matching Problems,transversal problems generalize several vertex partition problems and have been studied for various classes of graphs. Following a result of Farrugia, the stable transversal problem for each .. with ℓ ≥ 3 is NP-complete. In this paper, we study an ‘edge version’ of these problems. Specifically, we i

并置

Chronological

2-Layer Right Angle Crossing Drawings,e edges are straight-line segments. In this paper we study 2-layer drawings where all edge crossings form right angles. We characterize which graphs admit this type of drawing, provide linear-time testing and embedding algorithms, and present a polynomial-time crossing minimization technique. Also,

indignant

Hamiltonian Orthogeodesic Alternating Paths,f different colour and no two edges cross. We consider the problem of deciding whether there exists a . orthogeodesic alternating path, i.e., an orthogeodesic alternating path visiting all points. We provide an .(. log..)-time algorithm for finding such a path if no two points are horizontally or ve

我不怕牺牲

Ranking and Loopless Generation of ,-ary Dyck Words in Cool-lex Order,he number of 1s. We provide two loopless algorithms for generating .-ary Dyck words in cool-lex order: (1) The first requires two index variables and assumes . is a constant; (2) The second requires . index variables and works for any .. We also efficiently rank .-ary Dyck words in cool-lex order. O

倔强一点

Two Constant-Factor-Optimal Realizations of Adaptive Heapsort,t comparisons, where . is the number of elements stored. One priority queue is based on a weak heap (array-based) and the other on a weak queue (pointer-based). In both, the main idea is to temporarily store the inserted elements in a buffer, and once it is full to move its elements to the main queu

Systemic

A Unifying Property for Distribution-Sensitive Priority Queues, .. (respectively, ..) is the number of elements that were accessed after (respectively, before) the last access of . and are still in the priority queue at the time when the corresponding operation is performed. Our priority queue then has both the working-set and the queueish properties; and, more

衰弱的心

Enumerating Tatami Mat Arrangements of Square Grids,2., when . and . have the same parity. In addition, we present a new proof of the result that there are .2. such tilings with . monomers, which divides the tilings into . classes of size 2.. The sum of these over all . ≤ . has the closed form 2.(3. − 4) + 2 and, curiously, this is equal to the sum o

饮料

拱墙

Combinatorial Algorithms978-3-642-25011-8Series ISSN 0302-9743 Series E-ISSN 1611-3349