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 “"Graphs algorithm"”.

  1. Graph Isomorphism Algorithms Based on Trees and Paths.

    Polynomially bounded algorithms are presented for testing isomorphism of two classes of graphs: the strongly regular graphs, which have been difficult for many previous isomorphism algorithms to process, and the compact graphs (graphs with diameter of 2 whose complements also have diameter of …

    uab Repository record for Graph Isomorphism Algorithms Based on Trees and Paths. (opens in a new tab)

  2. Euristiniai algoritmai grafų palyginimui /

    … study of graph edit distance (GED) heuristic algorithms with the goal of improving the performance and accuracy of state of the art heuristics. First half of this paper defines GED and provides detailed explanation of three heuristic algorithm classes for computing GED. In the second half, …

    vilnius Repository record for Euristiniai algoritmai grafų palyginimui / (opens in a new tab)

  3. Συλλογή, ανάλυση και επεξεργασία δεδομένων από κοινωνικά δίκτυα με σκοπό την ανάλυση συναισθήματος και την ανίχνευση γεγονότων

    … clustering approach resembling Dirichlet process algorithm. Furthermore, we scrutinize the effectiveness of a series of pre-processing steps in improving the detection performance. The problem of sentiment analysis focusing on social media data has also been extensively examined and a sentiment …

    greece Repository record for Συλλογή, ανάλυση και επεξεργασία δεδομένων από κοινωνικά δίκτυα με σκοπό την ανάλυση συναισθήματος και την ανίχνευση γεγονότων (opens in a new tab)

  4. Grafy a grafové algoritmy

    Práca obsahuje základné uvedenie do teórie grafov s charakteristikou vybraných algoritmov, ktoré sa zameriavajú na riešenie úloh spojených s hladaním najkratšej cesty v grafoch. Objasňuje spôsoby hladania riešenia a výhody a nevýhody každého zo spomenutých algoritmov.

    brno-tech Repository record for Grafy a grafové algoritmy (opens in a new tab)

  5. Odd multiway cut in directed acyclic graphs

    … by the size of the solution in undirected graphs. In this work, we focus on directed acyclic graphs (DAGs) and design a fixed-parameter algorithm. Our main contribution is a broadening of the shadow-removal framework to address parity problems in DAGs. We complement our FPT results with …

    uiuc Repository record for Odd multiway cut in directed acyclic graphs (opens in a new tab)

  6. A Faster Algorithm for Recognizing Edge-Weighted Interval Graphs

    Interval graphs—the intersection graphs of one-dimensional intervals—are considered one of the most useful mathematical structures to model real life applications. Interval graphs have been widely studied since they first appeared in the literature in 1957. In 1976, Booth and Lueker introduced a …

    waterloo Repository record for A Faster Algorithm for Recognizing Edge-Weighted Interval Graphs (opens in a new tab)