Results 1  10
of
1,413,192
Comparison of GraphSearch Algorithms for Authorization
 In Proceedings of 2nd Nordic Workshop on Secure Computer Systems
, 1997
"... We describe and compare several algorithms for authorization decisions from a database of certificates. The algorithms are based on wellknown graphsearch techniques that we enhance to handle jointdelegation certificates. Experiments on generated certificate data were done to compare the effici ..."
Abstract
 Add to MetaCart
We describe and compare several algorithms for authorization decisions from a database of certificates. The algorithms are based on wellknown graphsearch techniques that we enhance to handle jointdelegation certificates. Experiments on generated certificate data were done to compare
A Graph Search Algorithm for Indoor Pursuit / Evasion
, 2008
"... Using concepts from both robotics and graph theory, we formulate the problem of indoor pursuit / evasion in terms of searching a graph for a mobile evader. We present an offline, greedy, iterative algorithm which performs guaranteed search, i.e. no matter how the evader moves, it will eventually be ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Using concepts from both robotics and graph theory, we formulate the problem of indoor pursuit / evasion in terms of searching a graph for a mobile evader. We present an offline, greedy, iterative algorithm which performs guaranteed search, i.e. no matter how the evader moves, it will eventually
Formalization of Graph Search Algorithms and Its Applications
, 1998
"... This paper describes a formalization of a class of fixedpoint problems on graphs and its applications. This class captures several wellknown graph theoretical problems such as those of shortest path type and for data flow analysis. An abstract solution algorithm of the fixedpoint problem is forma ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This paper describes a formalization of a class of fixedpoint problems on graphs and its applications. This class captures several wellknown graph theoretical problems such as those of shortest path type and for data flow analysis. An abstract solution algorithm of the fixedpoint problem
AverageCase Analysis of GraphSearching Algorithms
, 1990
"... We estimate the expected value of various search quantities for a variety of graphsearching methods, for example depthfirst search and breadthfirst search. Our analysis applies to both directed and undirected random graphs, and it covers the range of interesting graph densities, including densit ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
densities at which a random graph is disconnected with a giant connected component. We estimate the number of edges examined during the search, since this number is proportional to the running time of the algorithm. We find that for hardly connected graphs, all of the edges might be examined, but for denser
Fast GraphSearch Algorithms for General Aviation Flight Trajectory Generation
, 2004
"... We consider numerical algorithms for onboard flight trajectory generation and optimization in three dimensional space. Our approach relies on graph search algorithms, which perform a global search over the set of feasible trajectories. We start by formulating a simplified kinematic model that is ap ..."
Abstract
 Add to MetaCart
We consider numerical algorithms for onboard flight trajectory generation and optimization in three dimensional space. Our approach relies on graph search algorithms, which perform a global search over the set of feasible trajectories. We start by formulating a simplified kinematic model
Depth first search and linear graph algorithms
 SIAM JOURNAL ON COMPUTING
, 1972
"... The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect ..."
Abstract

Cited by 1384 (19 self)
 Add to MetaCart
The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components
Comparison of GraphSearch Algorithms for Authorization Verification in Delegation Networks
 In Proceedings of 2nd Nordic Workshop on Secure Computer Systems
, 1997
"... We describe and compare several algorithms for authorization decisions from a database of certificates. The algorithms are based on wellknown graphsearch techniques that we enhance to handle jointdelegation certificates. Experiments on generated certificate data were done to compare the efficienc ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We describe and compare several algorithms for authorization decisions from a database of certificates. The algorithms are based on wellknown graphsearch techniques that we enhance to handle jointdelegation certificates. Experiments on generated certificate data were done to compare
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3499 (47 self)
 Add to MetaCart
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions
AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS
, 1973
"... The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/. ..."
Abstract

Cited by 712 (1 self)
 Add to MetaCart
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.
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
as follows: ffl We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. ffl We present several efficient dynamic drawing algorithms for trees, seriesparallel digraphs, planar stdigraphs, and planar
Results 1  10
of
1,413,192