Sciweavers

43 search results - page 9 / 9
» A Generic Approach for Sparse Path Problems
Sort
View
WEA
2005
Springer
98views Algorithms» more  WEA 2005»
14 years 4 months ago
Implementing Minimum Cycle Basis Algorithms
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
Kurt Mehlhorn, Dimitrios Michail
FCT
2003
Springer
14 years 4 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
ICSR
2004
Springer
14 years 4 months ago
XML-Based Feature Modelling
This paper describes a feature modelling technique aimed at modelling the software assets behind a product family. The proposed technique is distinctive in five respects. First, it...
Vaclav Cechticky, Alessandro Pasetti, O. Rohlik, W...