689 search results - page 17 / 138 » A Modal-Logic Based Graph Abstraction |
FASE
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, e...
DAM
2006
13 years 10 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
PARA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
GBRPR
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...
GD
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...