4074 search results - page 417 / 815 » Abstract Graph Transformation |
180
click to vote
COCOA
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
271
click to vote
FCA
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. A main goal of Formal Concept Analysis from its very beginning has been the support of rational communication. The source of this goal lies in our understanding of mathem...
167
Voted
WEA
2005
Springer
16 years 7 days ago
2005
Springer
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...
175
click to vote
WAW
2004
Springer
16 years 3 days ago
2004
Springer
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
233
Voted
FUIN
2007
15 years 6 months ago
2007
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...