94 search results - page 1 / 19 » The Generic Graph Component Library |
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...
ISCOPE
1999
Springer
13 years 11 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
GPCE
2005
Springer
14 years 10 days ago
2005
Springer
Abstract. The past decade of experience has demonstrated that the generic programming methodology is highly effective for the design, implementation, and use of large-scale softwar...
BMCBI
2008
13 years 7 months ago
2008
Background: The use of novel algorithmic techniques is pivotal to many important problems in life science. For example the sequencing of the human genome [1] would not have been p...
IPPS
2002
IEEE
13 years 11 months ago
2002
IEEE
This paper discusses concept lattices and some of their applications in component library development and compiler optimizations. Ongoing work on concept-based userextensible simp...