Name
Abstract | ||
|---|---|---|
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 proved that the isomorphism of circular-arc graphs can be tested by the Weisfeiler-Leman algorithm after individualization of two vertices. |
Year | Venue | DocType |
|---|---|---|
2019 | arXiv: Data Structures and Algorithms | Journal |
Volume | Citations | PageRank |
abs/1903.11062 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roman Nedela | 1 | 392 | 47.78 |
| Ilia N. Ponomarenko | 2 | 40 | 7.24 |
| Peter Zeman | 3 | 6 | 3.14 |