2 citations · 4 across the 5 of their papers we have counts for
4 papers · 1 filter
Extending Partial Representations of Circular-Arc Graphs
Jiří Fiala, Ignaz Rutter, Peter Stumpf +1
The partial representation extension problem generalizes the recognition problem for classes of graphs defined in terms of vertex representations. We exhibit circular-arc graphs as…
Circle Graph Isomorphism in Almost Linear Time
Vít Kalisz, Pavel Klavík, Peter Zeman
Circle graphs are intersection graphs of chords of a circle. In this paper, we present a new algorithm for the circle graph isomorphism problem running in time whe…
Discrete and Fast Fourier Transform Made Clear
Peter Zeman
Fast Fourier transform was included in the Top 10 Algorithms of 20th Century by Computing in Science & Engineering. In this paper, we provide a new simple derivation of both the di…
Testing isomorphism of circular-arc graphs in polynomial time
Roman Nedela, Ilia Ponomarenko, Peter Zeman
A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is pr…