The hardness of approximating the boxicity, cubicity and threshold dimension of a graph.
Abhijin AdigaDiptendu BhowmickL. Sunil ChandranPublished in: Discret. Appl. Math. (2010)
Keyphrases
- graph theory
- weighted graph
- random walk
- connected components
- graph representation
- graph structure
- bipartite graph
- graph databases
- structured data
- phase transition
- learning theory
- np hard
- link analysis
- directed acyclic graph
- graph model
- data sets
- graph based algorithm
- graph search
- dependency graph
- graph theoretic
- graph partitioning
- undirected graph
- computational complexity
- similarity measure
- learning algorithm