Suchergebnisse - "Special Issue: Algorithms and Computation"

Editorial: Special issue Algorithms and Computation

Volltext

Envy-Free Matchings with Lower Quotas von Yokoi, Yu

“… While every instance of the Hospitals/Residents problem admits a stable matching, the problem with lower quotas (HR-LQ) has instances with no stable matching …”
Volltext

A Simple Greedy Algorithm for Dynamic Graph Orientation von Berglin, Edvin, Brodal, Gerth Stølting

“… Graph orientations with low out-degree are one of several ways to efficiently store sparse graphs. If the graphs allow for insertion and deletion of edges, one …”
Volltext

Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces von Becker, Aaron T., Fekete, Sándor P., Keldenich, Phillip, Krupke, Dominik, Rieck, Christian, Scheffer, Christian, Schmidt, Arne

“… We present algorithmic results for the parallel assembly of many micro-scale objects in two and three dimensions from tiny particles, which has been proposed …”
Volltext

On Using Toeplitz and Circulant Matrices for Johnson–Lindenstrauss Transforms von Freksen, Casper Benjamin, Larsen, Kasper Green

“… The Johnson–Lindenstrauss lemma is one of the cornerstone results in dimensionality reduction. A common formulation of it, is that there exists a random linear …”
Volltext

Crossing Number for Graphs with Bounded Pathwidth von Biedl, Therese, Chimani, Markus, Derka, Martin, Mutzel, Petra

“… The crossing number is the smallest number of pairwise edge crossings when drawing a graph into the plane. There are only very few graph classes for which the …”
Volltext

Fast Compressed Self-indexes with Deterministic Linear-Time Construction von Munro, J. Ian, Navarro, Gonzalo, Nekrich, Yakov

“… We introduce a compressed suffix array representation that, on a text T of length n over an alphabet of size σ , can be built in O ( n ) deterministic time, …”
Volltext

Study of a Combinatorial Game in Graphs Through Linear Programming von Cohen, Nathann, Mc Inerney, Fionn, Nisse, Nicolas, Pérennes, Stéphane

“… In the Spy game played on a graph G , a single spy travels the vertices of G at speed s , while multiple slow guards strive to have, at all times, one of them …”
Volltext

Guest Editorial: Selected Papers from ISAAC 2017 von Okamoto, Yoshio

Volltext

Maximum Induced Matching Algorithms via Vertex Ordering Characterizations von Habib, Michel, Mouatadid, Lalla

“… We study the maximum induced matching problem on a graph G . Induced matchings correspond to independent sets in L 2 ( G ) , the square of the line graph of G …”
Volltext

An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner von Bilò, Davide, Colella, Feliciano, Gualà, Luciano, Leucci, Stefano, Proietti, Guido

“… A tree σ -spanner of a positively real-weighted n -vertex and m -edge undirected graph G is a spanning tree T of G which approximately preserves (i.e., up to a …”
Volltext

On the Convergence Time of a Natural Dynamics for Linear Programming von Bonifaci, Vincenzo

“… We consider a system of nonlinear ordinary differential equations for the solution of linear programming (LP) problems that was first proposed in the …”
Volltext