Who Needs Crossings? Hardness of Plane Graph Rigidity.
Zachary AbelErik D. DemaineMartin L. DemaineSarah EisenstatJayson LynchTao B. SchardlPublished in: SoCG (2016)
Keyphrases
- graph structure
- three dimensional
- graph theory
- bipartite graph
- point correspondences
- random walk
- graph theoretic
- graph representation
- directed graph
- np complete
- computational complexity
- graph matching
- graph clustering
- search algorithm
- neural network
- graph partitioning
- undirected graph
- subgraph isomorphism
- graph databases
- graph model
- graph mining
- weighted graph
- bayesian networks
- learning theory
- phase transition