Complexity of planar signed graph homomorphisms to cycles.
François DrossFlorent FoucaudValia MitsouPascal OchemThéo PierronPublished in: Discret. Appl. Math. (2020)
Keyphrases
- graph theory
- planar graphs
- graph model
- graph representation
- graph structure
- random walk
- graph theoretic
- space complexity
- stable set
- search engine
- dependency graph
- graph search
- random graphs
- weighted graph
- directed graph
- connected components
- decision problems
- structured data
- computational cost
- special case
- computational complexity