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 6 of 6 for “"Graph editing"”.

  1. Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable

    Graph editing problems have a long history and have been widely studied, with applications in biochemistry and complex network analysis. They generally ask whether an input graph can be modified by inserting and deleting vertices and edges to a graph with the desired property. We consider the …

    waterloo Repository record for Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable (opens in a new tab)

  2. Grafų redagavimo atstumas /

    Graph editing distance is a measure of similarity or dissimilarity between two graphs. In this work, the algorithms for calculating the editing distance of classical A * graphs and their optimizations are analyzed. The aim is to develop graph editing algorithms with different search tree bypass …

    vilnius Repository record for Grafų redagavimo atstumas / (opens in a new tab)

  3. A graph neural network approach to interval and box graph completion problems

    Interval and box graph editing/completion problems are interesting in the field of graph theory, whose aim is to transform an arbitrary graph into an interval or box graph by adding or removing edges, with a minimum number of such modifications. There are many existing algorithms that make use of …

    ubc Repository record for A graph neural network approach to interval and box graph completion problems (opens in a new tab) Download PDF for A graph neural network approach to interval and box graph completion problems (opens in a new tab)

  4. Modularity in Biological Networks

    … are not fully partitionable as a union of split graphs, and posed the problem of finding modules and transition regions as a graph editing problem, proving its hardness and providing exact algorithms and heuristics. The discussion of each of the two tasks is completed by an example of a …

    fu-berlin Repository record for Modularity in Biological Networks (opens in a new tab)

  5. A Novel Representation for Graph Evolution

    Networks and combinatorial graphs are commonly used in a wide variety of types of mathematical modelling to represent structures such as contact networks in epidemiology, road networks in urban planning, and scheduling conflicts. Introduction to the topic of graphs comes through a brief look at the …

    guelph Repository record for A Novel Representation for Graph Evolution (opens in a new tab)