11 citations · 23 across the 21 of their papers we have counts for
3 papers · 2 filters
Succinct Permutation Graphs
Konstantinos Tsakalidis, Sebastian Wild, Viktor Zamaraev
We present a succinct data structure for permutation graphs, and their superclass of circular permutation graphs, i.e., data structures using optimal space up to lower order terms.…
Matching in Stochastically Evolving Graphs
Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios +2
This paper studies the maximum cardinality matching problem in stochastically evolving graphs. We formally define the arrival-departure model with stochastic departures. There, a g…
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis +1
In this paper we consider the following total functional problem: Given a cubic Hamiltonian graph and a Hamiltonian cycle of , how can we compute a second Hamiltonian…