10271 search results - page 637 / 2055 » Computer Science |
218
click to vote
WG
2009
Springer
16 years 2 months ago
2009
Springer
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...
167
click to vote
COMPLEX
2009
Springer
16 years 2 months ago
2009
Springer
In this paper, we present our ongoing work on developing a framework for detecting time-varying communities on human mobile networks. We define the term community in environments ...
187
click to vote
COMPLEX
2009
Springer
16 years 2 months ago
2009
Springer
This paper recognises that comparisons have been made between the role of the conductor of an orchestra and leaders of enterprises, but that little note has been taken of how the c...
149
Voted
CSR
2009
Springer
16 years 2 months ago
2009
Springer
We apply the semantic tool of non-deterministic matrices to characterize two important properties of canonical Gentzen-type calculi: invertibility of rules and axiom expansion. We ...
195
Voted
CSR
2009
Springer
16 years 2 months ago
2009
Springer
A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f : V (G) → V (H) such that if uv ∈ E(G) then f(u)f(v) ∈ E(H). The pro...