A New Lower Bound for the Minimum Linear Arrangement of a Graph.
André Renato Sales AmaralAlberto CapraraAdam N. LetchfordJuan José Salazar GonzálezPublished in: Electron. Notes Discret. Math. (2008)
Keyphrases
- lower bound
- constant factor
- upper bound
- min sum
- branch and bound algorithm
- spanning tree
- objective function
- branch and bound
- graph structure
- random walk
- edge disjoint
- lower and upper bounds
- worst case
- structured data
- np hard
- graph theory
- directed acyclic graph
- graph model
- linear systems
- graph theoretic
- graph representation
- optimal solution
- graph mining
- directed graph
- graph databases
- minimum cost
- bipartite graph
- random graphs
- lower bounding
- maximum flow
- series parallel
- graph based algorithm
- minimum cut
- scheduling problem
- sufficiently accurate
- pairwise
- connected dominating set