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 11 of 11 for “"reduced graph"”.
-
Zero Divisor Graphs and Poset Decomposition
A graph is associated to any commutative ring R where the vertices are the non-zero zero divisors of R with two vertices adjacent if x · y = 0. The zero-divisor graph has also been studied for various algebraic stuctures such as semigroups and partially ordered sets. In this paper, we will discuss …
-
Algorithms for flows and disjoint paths in planar graphs
… connectivity, and disjoint paths in planar graphs. In all cases, the algorithms are either the first polynomial-time algorithms or are faster than all previously-known algorithms. First, we describe algorithms for the maximum flow problem in directed planar graphs with integer capacities on …
-
Cuts and connectivity in graphs and hypergraphs
… we consider cut and connectivity problems on graphs, digraphs, hypergraphs and hedgegraphs. The main results are the following: - We introduce a faster algorithm for finding the reduced graph in element-connectivity computations. We also show its application to node separation. - We present …
-
UNDERSTANDING SPATIAL EVOLUTION OF HDB UNITS USING NETWORK ANALYSIS
… units and altered units were compared using reduced-graph analysis. The survey functioned as a qualitative analysis to relate the lifestyle patterns of contemporary society to the housing configuration. Lastly, spatial satisfaction from the survey was used to determine the association between …
-
Parameterised verification of randomised distributed systems using state-based models
… a model of a system with given communication graph eventually behaves like a model of a system with a reduced graph, where reduction is by removal of a set of nodes. We distinguish between deterministically, probabilistically and semi-degenerative systems, according to the manner in which a …
-
Pattern matching in massive metadata graphs at scale
Pattern matching in graphs, that is finding subgraphs that match a smaller template graph within the large background graph is fundamental to graph analysis and serves a rich set of applications. Unfortunately, existing solutions have limited scalability, are difficult to parallelize, support only …
-
The automatic design of batch processing systems
… be in consistent state. A 'state dependency graph' is derived from a static analysis of a specification. The reduced graph of its strongly-connected components defines a canonical process network from which all possible implementations of the system can be derived by composition. From these …
-
Visualization of fundamental structures in two dimensional second order tensor fields on planar and curved surfaces
… all essential structural features in a strongly reduced graph structure. This graph structure is used as a basis to develop enriched visualization methods. In this vein, a complete segmentation is presented that partitions the field into regions of homogeneous eigenvector and eigenvalue behavior. …
-
On Eulerian subgraphs and hamiltonian line graphs
A graph {\color{black}$G$} is Hamilton-connected if for any pair of distinct vertices {\color{black}$u, v \in V(G)$}, {\color{black}$G$} has a spanning $(u,v)$-path; {\color{black}$G$} is 1-hamiltonian if for any vertex subset $S \subseteq {\color{black}V(G)}$ with $|S| \le 1$, $G - S$ has a …
-
A Local Measurement Based Protection Methodology for Initiating Controlled Islanding in Power Systems
… method based on spectral clustering with graph reduction technique is adopted, which is also triggered in parallel after the coherency detection. A graph representation of the power network is obtained in this method, which is reduced using different graph reduction techniques. The …
-
Circuits and Cycles in Graphs and Matroids
… focuses on characterizing cycles and circuits in graphs, line graphs and matroids. We obtain the following advances. 1. Results in graphs and line graphs. For a connected graph G not isomorphic to a path, a cycle or a K1,3, let pc(G) denote the smallest integer n such that the nth iterated line …