Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"optimal linear arrangement"”.

  1. Graph compression using heuristic-based reordering

    … is a well known NP complete problem, the Optimal Linear Arrangement.</p> <p>Our work focuses on the inverted index format, where each node has its corresponding list ofneighbours. We propose a heuristic based graph reordering, using the property that the cost ofeach vertex is bound by its …

    iastate Repository record for Graph compression using heuristic-based reordering (opens in a new tab)

  2. Related Orderings of AT-Free Graphs

    … consider the problems Cutwidth, Imbalance, and Optimal Linear Arrangement. We also consider a problem of another type: S-End-Vertex, where S is one of the following search algorithms: breadth-first search (BFS), lexicographic breadth-first search (LBFS), depth-first search (DFS), and maximal …

    waterloo Repository record for Related Orderings of AT-Free Graphs (opens in a new tab)