Results 1  10
of
1,829,764
Graphtheoretic techniques for . . .
, 1988
"... Parallel computation presents problems which are either nonexistent or trivial in the context of sequential computation. Thus, design of efficient algorithms for parallel and distributed computation requires development of new tools and techniques. This thesis considers a number of fundamental pro ..."
Abstract
 Add to MetaCart
problems that arise in the context of parallel and distributed computation and describes several graphtheoretic techniques to address these problems. It also presents several new insights into the structure of
Graph Theoretic Techniques for Pruning Data and Their Applications
"... In pattern recognition tasks, we usually do not pay much attention to the arbitrarily chosen training set of a pattern classifier beforehand. This paper proposes several methods for pruning data sets based on graph theory in order to alleviate the redundancy in the original data set whilst retaining ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In pattern recognition tasks, we usually do not pay much attention to the arbitrarily chosen training set of a pattern classifier beforehand. This paper proposes several methods for pruning data sets based on graph theory in order to alleviate the redundancy in the original data set whilst
GraphTheoretic Techniques in DOptimal Design Problems
, 2001
"... We solve several problems in DOptimal Design theory using techniques from Graph theory and Combinatorics. The techniques involve relating the value of a determinant of a 01 matrix with the number of certain perfect matchings in a bipartite graph. ..."
Abstract
 Add to MetaCart
We solve several problems in DOptimal Design theory using techniques from Graph theory and Combinatorics. The techniques involve relating the value of a determinant of a 01 matrix with the number of certain perfect matchings in a bipartite graph.
A Graph Theoretic Technique to Speed up
"... A well known approach for the floorplan area optimization problem is to first determine a list of all nonredundant implementations of the entire floorplan and then select an optimal floorplan from the list [4,6,9,10,12]. For large floorplans, this approach may fail due to insufficient memory space ..."
Abstract
 Add to MetaCart
A well known approach for the floorplan area optimization problem is to first determine a list of all nonredundant implementations of the entire floorplan and then select an optimal floorplan from the list [4,6,9,10,12]. For large floorplans, this approach may fail due to insufficient memory space available to store the implementations of sub floorplans generated during the computation. To effectively reduce both memory usage and running time, we present in this paper two algorithms to optimally reduce the number of implementations for rectangular and Lshaped subfloorplans. The common key idea of our two algorithms is to reduce the problem to a constrained shortest path problem, which we can solve optimally in polynomial time. Our algorithms are designed specifically for [lo] but they can also be applied to other algorithms such as [4,6,12] as well. The experimental results are very encouraging. 1
Effective Graph Theoretic Techniques for the Generalized Low Power Binding Problem
"... This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First the generalized low power binding problem is formulated as an Integer Linear Programming(ILP) problem which happens to be ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First the generalized low power binding problem is formulated as an Integer Linear Programming(ILP) problem which happens
A Survey on Traditional and Graph Theoretical Techniques for Image Segmentation
"... Image segmentation is the process of subdividing a digital image into its systematized regions or objects which is useful in image analysis. In this review paper, we carried out an organized survey of many image segmentation techniques which are flexible, cost effective and computationally more effi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
efficient. We classify these segmentation methods into three categories: the traditional methods, graph theoretical methods and combination of both traditional and graph theoretical methods. In the second and third category of image segmentation approaches, the image is modeled as a weighted and undirected
EVALUATING THE NETWORK SURVIVABILITY ISSUE OF KBEST PATHS THROUGH GRAPH THEORETIC TECHNIQUES
"... I would like to thank my professor Dr. Andreas Pitsillides for his close cooperation we had during the authorship of my thesis and also for the invaluable help he offered. His advise and direction contributed in the biggest possible way, for the successful completion of this work. Also to my colleag ..."
Abstract
 Add to MetaCart
colleagues and especially Josephine Antoniou for her help I owe one big thank to Katerina for her support tolerance but also understanding that she showed. Finally I would want to thank the God that allowed me to complete with success this work. iSummary In this thesis graph theoretic techniques
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized
Results 1  10
of
1,829,764