PODC
2011
ACM
12 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
SEMWEB
2010
Springer
13 years 4 months ago
2010
Springer
The Semantic Web graph is growing at an incredible pace, enabling opportunities to discover new knowledge by interlinking and analyzing previously unconnected data sets. This confr...
PPL
2007
13 years 6 months ago
2007
Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel c...
COLING
2002
13 years 6 months ago
2002
This paper presents an unsupervised method for assembling semantic knowledge from a part-ofspeech tagged corpus using graph algorithms. The graph model is built by linking pairs o...
GD
2006
Springer
13 years 10 months ago
2006
Springer
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
IFL
1997
Springer
13 years 11 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
OOPSLA
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
ICPP
2006
IEEE
14 years 25 days ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
ICAS
2006
IEEE
14 years 25 days ago
2006
IEEE
— The development of applications that target dynamic networks often adresses the same difficulties. Since the underlying network topology is unstable, the application has to ha...