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 19 of 19 for “"Graph searching"”.

  1. Graph searching and a generalized parking function

    … the G-multiparking function, where G is a simple graph on a totally ordered vertex set {1, 2, . . . , n}. We give an algorithm that converts a G-multiparking function into a rooted spanning forest of G by using a graph searching technique to build a sequence F1, F2, . . . , Fn, where each Fi is a …

    tamu Repository record for Graph searching and a generalized parking function (opens in a new tab)

  2. One-Visibility Cops and Robber on Trees

    Graph searching comes into the limelight of research topics since it provides mathematical models for many real-world problems. Cops and robber is one aspect of graph searching that has recently gained much interest. This thesis provides results on a graph searching model, one-visibility cops and …

    regina Repository record for One-Visibility Cops and Robber on Trees (opens in a new tab) Download PDF for One-Visibility Cops and Robber on Trees (opens in a new tab)

  3. Clearing Contamination in Large Networks

    … a large network where we model the problem as a graph searching game. The problem can be summarized as constructing a search strategy that will leave the graph clear of any contamination at the end of the searching process in as few steps as possible. We show that this problem is NP-hard even on …

    uvic Repository record for Clearing Contamination in Large Networks (opens in a new tab)

  4. 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)

  5. High Clearance Collision-Free Paths

    … nodes are carefully joined to obtain a connected graph outside the obstacles. Standard graph searching algorithms are applied in the constructed connected graph to obtain high-clearance paths. We also present methods to remove a few free-region nodes to further increase clearance from obstacles. …

    unlv Repository record for High Clearance Collision-Free Paths (opens in a new tab) Download PDF for High Clearance Collision-Free Paths (opens in a new tab)

  6. Propagation processes: Full throttling and probabilistic zero forcing

    … including mathematical physics under the name ``graph infection", in graph searching problems in computer science, and in linear algebra as an upper bound on the multiplicity of an eigenvalue of a matrix described by a graph. With standard zero forcing, one colors some initial vertices of a graph …

    iastate Repository record for Propagation processes: Full throttling and probabilistic zero forcing (opens in a new tab)

  7. ΔΙΑΤΑΞΕΙΣ ΔΙΑΓΡΑΦΩΝ, ΠΑΙΧΝΙΔΙΑ ΚΑΙ ΕΛΑΣΣΟΝΑ ΣΕ ΓΡΑΦΗΜΑΤΑ

    … BOUNDS TO THEIR VALUES, THEIR RELATION WITH GRAPH SEARCHING PROBLEMS AND THEIR APPLICATION ON THE CONSTRAINT SATISFACTION PROBLEM AND THE ROUTING PROBLEM ON DISTRIBUTED COMPUTING SYSTEMS. THE BASIC RESULTS ARE THE FOLLOWING. 1) SUBLINEAR ALGORITHM FOR ENFORCING PARTIAL ARE CONSISTENCY ON …

    greece Repository record for ΔΙΑΤΑΞΕΙΣ ΔΙΑΓΡΑΦΩΝ, ΠΑΙΧΝΙΔΙΑ ΚΑΙ ΕΛΑΣΣΟΝΑ ΣΕ ΓΡΑΦΗΜΑΤΑ (opens in a new tab)

  8. Efficient Algorithms on Cocomparability Graphs via Vertex Orderings

    … and algorithmic results on cocomparability (ccp) graphs; particularly, by connecting structural properties of graph searching to those of ver- tex ordering characterizations and linear extensions of posets. To do so, we present new tools that we hope will prove useful on other applications – …

    toronto-retro Repository record for Efficient Algorithms on Cocomparability Graphs via Vertex Orderings (opens in a new tab)

  9. Ανάλυση μέσης περίπτωσης αλγορίθμων ψαξίματος σε γράφους

    … of various search quantities for a variety of graph-searching methods, for example \dfs\ and \bfs. Our analysis applies to both directed and undirected random graphs, and it covers the range of interesting graph densities, including densities at which a random graph is disconnected with a giant …

    greece Repository record for Ανάλυση μέσης περίπτωσης αλγορίθμων ψαξίματος σε γράφους (opens in a new tab)

  10. Trajectory Planning for Hyper-Redundant Manipulators in Constrained Workspaces

    … workspaces. This approach consists of generating graphs of random configurations in the occupancy grid map whose nodes/edges correspond to feasible preprocessed trajectory between these configurations and then using a graph search algorithm to find the least cost of total movements of redundant …

    regina Repository record for Trajectory Planning for Hyper-Redundant Manipulators in Constrained Workspaces (opens in a new tab) Download PDF for Trajectory Planning for Hyper-Redundant Manipulators in Constrained Workspaces (opens in a new tab)

  11. Lower Bounds and Algorithms for Searching Networks

    Research on graph searching has recently gained interest in computer science, mathematics, and physics. This thesis provides new results on two graph search models, namely fast searching and the zero-visibility cops and robber model. Given a graph that contains an invisible fugitive, the fast …

    regina Repository record for Lower Bounds and Algorithms for Searching Networks (opens in a new tab) Download PDF for Lower Bounds and Algorithms for Searching Networks (opens in a new tab)

  12. Cops and Robber Game with a Fast Robber

    Graph searching problems are described as games played on graphs, between a set of searchers and a fugitive. Variants of the game restrict the abilities of the searchers and the fugitive and the corresponding search number (the least number of searchers that have a winning strategy) is related to …

    waterloo Repository record for Cops and Robber Game with a Fast Robber (opens in a new tab)

  13. QUANTITATIVE DIGITAL CORONARY ANGIOGRAPHY

    … another centerline tracking algorithm, the graph searching method is able to found to be able to solve the problem. Next, a template matching method uses the Gaussian convolution masks to extract features of the major arteries in the angiograms is developed. It requires the least operator …

    nus Repository record for QUANTITATIVE DIGITAL CORONARY ANGIOGRAPHY (opens in a new tab) Download file for QUANTITATIVE DIGITAL CORONARY ANGIOGRAPHY (opens in a new tab)

  14. Scalable algorithms for misinformation prevention in social networks

    … of existing misinformation is modelled as a graph searching game. The problem can be summarized as constructing a search strategy that will leave the graph clear of any misinformation at the end of the searching process in as few steps as possible. Despite the problem being NP-hard, even on …

    uvic Repository record for Scalable algorithms for misinformation prevention in social networks (opens in a new tab)

  15. Optimized heuristic implementations in al multi - agent systems

    … research by implementing algorithms and hyper-graph theory on a series of random theoretical computer science problems. A main motivation is that thousands of real-life problems can be formulated as abstract combinatorial optimization problems. Albeit, multi-agent systems can also be used to …

    greece Repository record for Optimized heuristic implementations in al multi - agent systems (opens in a new tab)

  16. Μερικές διατάξεις και αλγόριθμοι σε γραφήματα

    In the Graph Minors project, N. Robertson and P. Seymour, proveda series of structural and algorithmic results. Some of them, such as theStrong and the Weak Structure Theorem, the Excluded Grid Theoremand the algorithm for Minor Containment, constitute a rich source ofmany more structural as well …

    greece Repository record for Μερικές διατάξεις και αλγόριθμοι σε γραφήματα (opens in a new tab)

  17. Modelování skladů pomocí grafického rozhraní

    Diplomová práca navrhuje nový algoritmus, ktorý umožňuje efektívnu konverziu grafickej reprezentácie skladu do grafovej reprezentácie a následne urýchľuje odhad ceny ciest. Navrhnutý algoritmus počíta vzdialenosti medzi ľubovoľnými miestami skladu na základe algoritmu BFS, „skeletonizácie" z …

    brno-tech Repository record for Modelování skladů pomocí grafického rozhraní (opens in a new tab)

  18. Walking forward and backward: towards graph-based searching and mining

    "Graphs are powerful vehicles to represent data objects that are interconnecting or interacting with each other. We explore random walks on various kinds of graph to address different searching and mining scenarios. This dissertation focuses on two symmetric forms of random walk called the forward …

    uiuc Repository record for Walking forward and backward: towards graph-based searching and mining (opens in a new tab)