On the hardness of recognizing triangular line graphs.
Pranav AnandHenry EscuadroRalucca GeraStephen G. HartkeDerrick StoleePublished in: Discret. Math. (2012)
Keyphrases
- graph matching
- graph theoretic
- computational complexity
- graph partitioning
- information theoretic
- structured objects
- graph theory
- line segments
- series parallel
- directed graph
- graph model
- np hardness
- graph construction
- production line
- graph clustering
- square grid
- graph mining
- spanning tree
- graph databases
- neural network
- graph structure
- line drawings
- phase transition
- connected components
- worst case
- data structure