3268 search results - page 360 / 654 » The hub number of a graph |
264
click to vote
FCA
2005
Springer
16 years 5 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...
164
click to vote
WEA
2005
Springer
16 years 4 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...
173
click to vote
WAW
2004
Springer
16 years 6 hour 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...
140
click to vote
ECP
1997
Springer
15 years 10 months ago
1997
Springer
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
162
click to vote
ICALP
1992
Springer
15 years 10 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...