Results 1  10
of
22
Generic programming: An introduction
 3rd International Summer School on Advanced Functional Programming
, 1999
"... ..."
SEMIRING FRAMEWORKS AND ALGORITHMS FOR SHORTESTDISTANCE PROBLEMS
, 2002
"... We define general algebraic frameworks for shortestdistance problems based on the structure of semirings. We give a generic algorithm for finding singlesource shortest distances in a weighted directed graph when the weights satisfy the conditions of our general semiring framework. The same algorit ..."
Abstract

Cited by 72 (20 self)
 Add to MetaCart
We define general algebraic frameworks for shortestdistance problems based on the structure of semirings. We give a generic algorithm for finding singlesource shortest distances in a weighted directed graph when the weights satisfy the conditions of our general semiring framework. The same algorithm can be used to solve efficiently classical shortest paths problems or to find the kshortest distances in a directed graph. It can be used to solve singlesource shortestdistance problems in weighted directed acyclic graphs over any semiring. We examine several semirings and describe some specific instances of our generic algorithms to illustrate their use and compare them with existing methods and algorithms. The proof of the soundness of all algorithms is given in detail, including their pseudocode and a full analysis of their running time complexity.
Minimization Algorithms for Sequential Transducers
, 2000
"... We present general algorithms for minimizing sequential finitestate transducers that output strings or numbers. The algorithms are shown to be efficient since in the case of acyclic transducers and for output strings they operate in O(S+E+V+(EV+F)x(Pmax+1)) steps, where S is the sum of ..."
Abstract

Cited by 55 (12 self)
 Add to MetaCart
We present general algorithms for minimizing sequential finitestate transducers that output strings or numbers. The algorithms are shown to be efficient since in the case of acyclic transducers and for output strings they operate in O(S+E+V+(EV+F)x(Pmax+1)) steps, where S is the sum of the lengths of all output labels of the resulting transducer, E the set of transitions of the given transducer, V the set of its states, F the set of final states, and Pmax one of the longest of the longest common prefixes of the output paths leaving each state of the transducer. The algorithms apply to a larger class of transducers which includes subsequential transducers.
I/Oefficient algorithms for graphs of bounded treewidth
 In Proceedings of the 12th Annual ACMSIAM Symposium on Discrete Algorithms (SODA’2001
, 2001
"... We present an algorithm that takes O(sort(N)) I/Os 1 to compute a tree decomposition of width at most k, for any graph G of treewidth at most k and size N. Given such a tree decomposition, we use a dynamic programming framework to solve a wide variety of problems on G in O(N/(DB)) I/Os, including th ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
We present an algorithm that takes O(sort(N)) I/Os 1 to compute a tree decomposition of width at most k, for any graph G of treewidth at most k and size N. Given such a tree decomposition, we use a dynamic programming framework to solve a wide variety of problems on G in O(N/(DB)) I/Os, including the singlesource shortest path problem and a number of problems that are NPhard on general graphs. The tree decomposition can also be used to obtain an optimal separator decomposition of G. We use such a decomposition to perform depthfirst search in G in O(N/(DB)) I/Os. As important tools that are used in the tree decomposition algorithm, we introduce flippable DAGs and present an algorithm that computes a perfect elimination ordering of a ktree in O(sort(N)) I/Os. The second contribution of our paper, which is of independent interest, is a general and simple framework for obtaining I/Oefficient algorithms for a number of graph problems that can be solved using greedy algorithms in internal memory. We apply this framework in order to obtain an improved algorithm for finding a maximal matching and the first deterministic I/Oefficient algorithm for finding a maximal independent set of an arbitrary graph. Both algorithms take O(sort(V +E)) I/Os. The maximal matching algorithm is used in the tree decomposition algorithm.
Using structure indices for efficient approximation of network properties
 Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
, 2006
"... Statistics on networks have become vital to the study of relational data drawn from areas including bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating many of the most important measures—such as betweenness centrality, closeness centrality, and graph diameter—requires iden ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Statistics on networks have become vital to the study of relational data drawn from areas including bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating many of the most important measures—such as betweenness centrality, closeness centrality, and graph diameter—requires identifying short paths in these networks. However, finding these short paths can be intractable for even moderatesize networks. We introduce the concept of a network structure index (NSI), a composition of (1) a set of annotations on every node in the network and (2) a function that uses the annotations to estimate graph distance between pairs of nodes. We present several varieties of NSIs, examine their time and space complexity, and analyze their performance on synthetic and real data sets. We show that creating an NSI for a given network enables extremely efficient and accurate estimation of a wide variety of network statistics on that network.
Using ontological and document similarity to estimate museum exhibit relatedness
 ACM Journal on Computing and Cultural Heritage
, 2011
"... Exhibits within Cultural Heritage collections such as museums and art galleries are arranged by experts with intimate knowledge of the domain, but there may exist connections between individual exhibits that are not evident in this representation. For example, the visitors to such a space may have t ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Exhibits within Cultural Heritage collections such as museums and art galleries are arranged by experts with intimate knowledge of the domain, but there may exist connections between individual exhibits that are not evident in this representation. For example, the visitors to such a space may have their own opinions on how exhibits relate to one another. In this paper, we explore the possibility of estimating the perceived relatedness of exhibits by museum visitors through a variety of ontological and document similaritybased methods. Specifically, we combine the Wikipedia category hierarchy with lexical similarity measures, and evaluate the correlation with the relatedness judgements of visitors. We compare our measure with simple document similarity calculations, based on either Wikipedia documents or web pages taken from the website for the museum of interest. We also investigate the hypothesis that physical distance in the museum space is a direct representation of the conceptual distance between exhibits. We demonstrate that ontological similarity measures are highly effective at capturing perceived relatedness and that the proposed raco (Related Article Conceptual Overlap) method is able to achieve results closest to relatedness judgements provided by human annotators compared to existing stateofthe art measures of semantic relatedness.
The Characterizations of Hingefree Networks
, 1996
"... In this paper, a graph representation model for the reliable network designs is presented. A graph is said to be hingefree if the removal of any single vertex in the graph results in no increase in distance between any two remaining vertices. The advantages of the proposed structure are not only re ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
In this paper, a graph representation model for the reliable network designs is presented. A graph is said to be hingefree if the removal of any single vertex in the graph results in no increase in distance between any two remaining vertices. The advantages of the proposed structure are not only residual connectedness but also distance inheritance. Moreover, a property related to the class of hingefree graphs and its generalization, called the kGC graphs (a class of connected graphs by removing at least k vertices is required to increase the distance between any two remaining vertices) , is established. Base on this property, we show that all the above classes of graphs can be recognized in O(jV j jEj) time in spite of the value of k. We also provide some extensions of graphs with respect to the hingefree property (resp. kGC property) such that a hingefree (resp. kGC) network on large scale can easily be constructed by using these operations. Finally, the relationships among hin...
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
"... Abstract. In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in order to maximize their betweenness centrality, a metric introduced in the social network analysis to measure th ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in order to maximize their betweenness centrality, a metric introduced in the social network analysis to measure the information flow through a node. To reflect real world scenarios where short paths are more important in information exchange, we generalize the betweenness definition to only consider shortest paths of length at most ℓ. We present both complexity and constructive existence results about Nash equilibria of the game. For the nonuniform version of the game where node budgets, link costs, and pairwise communication weights may vary, we show that Nash equilibria may not exist and it is NPhard to decide whether Nash equilibria exist in a game instance. For the uniform version of the game where link costs and pairwise communication weights are one and each node can build k links, we construct two families of Nash equilibria based on shift graphs, and study the properties of Nash equilibria. Moreover, we study the complexity of computing best responses and show that the task is polynomial for uniform 2B 3 C games and NPhard for other games.
Qualitative Modeling of Electrical Circuits
 QR’92: Sixth Int. Workshop on Qualitative Reasoning about Physical Systems
, 1992
"... This paper presents a new model for the qualitative analysis of electrical circuit behaviour. We show that a qualitative representation of electrical resistance provides a good intuitive model of connectivity. Features include an extended qualitative symbol set for current flow and the concepts of p ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper presents a new model for the qualitative analysis of electrical circuit behaviour. We show that a qualitative representation of electrical resistance provides a good intuitive model of connectivity. Features include an extended qualitative symbol set for current flow and the concepts of primary and secondary levels of activity. The algorithm assigns labels to network junctions, finds current paths from source to sink, and can make predictions about the effects of circuit topology changes. 1