Circle graphs (chord interlacement graphs) of Gauss diagrams: Descriptions of realizable Gauss diagrams, algorithms, enumeration.
Abdullah KhanAlexei LisitsaViktor LopatkinAlexei VernitskiPublished in: CoRR (2021)
Keyphrases
- graph theory
- maximal cliques
- maximal clique enumeration
- max cut
- graph construction
- graph matching
- learning algorithm
- graph theoretic
- computationally efficient
- computational cost
- graph isomorphism
- data structure
- optimization problems
- graph structure
- high level
- graph clustering
- data mining
- maximum cardinality
- social networks
- graph structures
- random graphs
- minimum spanning tree
- significant improvement
- graph model
- exhaustive search
- hough transform