Login / Signup
Lower Bounds for the Minimum Linear Arrangement of a Graph.
Alberto Caprara
Adam N. Letchford
Juan José Salazar González
Published in:
Electron. Notes Discret. Math. (2010)
Keyphrases
</>
connected components
lower bound
upper bound
min sum
graph mining
constant factor
np hard
objective function
linear systems
optimal solution
closed form
bipartite graph
directed acyclic graph
branch and bound algorithm
graph model
minimum cost
graph representation
vc dimension
shortest path
random walk