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 17 of 17 for “"Cutwidth"”.

  1. The Linear Cutwidth and Cyclic Cutwidth of Complete n-Partite Graphs

    <p>The cutwidth of different graphs is a topic that has been extensively studied. The basis of this paper is the cutwidth of complete <em>n</em>-partite graphs. While looking at the cutwidth of complete <em>n</em>-partite graphs, we strictly consider the linear embedding and cyclic embedding. The …

    csusb Repository record for The Linear Cutwidth and Cyclic Cutwidth of Complete n-Partite Graphs (opens in a new tab)

  2. Investigation of 4-cutwidth critical graphs

    … Discrete Math characterized the set of a 3-cutwidth critical graphs by five specified elements. This project extends the idea to 4-cutwidth critical graphs.

    csusb Repository record for Investigation of 4-cutwidth critical graphs (opens in a new tab)

  3. The cyclic cutwidth of mesh cubes

    … introduced in a professional paper on the cutwidth of meshes and then use this knowledge to apply it to the search for the cyclic cutwidth of the n-cube.

    csusb Repository record for The cyclic cutwidth of mesh cubes (opens in a new tab)

  4. Investigation of 4-cutwidth critical graphs

    … Discrete Math characterized the set of a 3-cutwidth critical graphs by five specified elements. This project extends the idea to 4-cutwidth critical graphs.

    csusb-retro Repository record for Investigation of 4-cutwidth critical graphs (opens in a new tab)

  5. The cyclic cutwidth of mesh cubes

    … introduced in a professional paper on the cutwidth of meshes and then use this knowledge to apply it to the search for the cyclic cutwidth of the n-cube.

    csusb-retro Repository record for The cyclic cutwidth of mesh cubes (opens in a new tab)

  6. Updating the Vertex Separation of a Dynamically Changing Tree

    … analogous bounds are presented for the cutwidth of a general graph, where the cutwidth of a graph equals the maximum number of edges that cross over a vertex, when the vertices in the graph are arranged in the best possible linear ordering.

    waterloo Repository record for Updating the Vertex Separation of a Dynamically Changing Tree (opens in a new tab)

  7. Related Orderings of AT-Free Graphs

    … ordering of the graph. We 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 …

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

  8. Algorithms for VLSI layout based on graph width metrics

    … ways to devise tests for them. Based on the cutwidth metric of graphs, we also develop algorithms for the Mini-mum Cut Linear Arrangement problem.</p>

    utk-theses Repository record for Algorithms for VLSI layout based on graph width metrics (opens in a new tab)

  9. Obstructions and algorithms for graph layouts problems

    Modern Graph Theory is heavily influenced by the seminal work of N. Robertson and P. Seymour, known as Graph Minors. Through this work, a wealth of structural, combinatorial, as well as algorithmic, results has been introduced, in a series of papers having as ultimate goal to give an affirmative …

    greece Repository record for Obstructions and algorithms for graph layouts problems (opens in a new tab)