103 search results - page 14 / 21 » Representations of graphs modulo n |
ICCS
2003
Springer
14 years 23 days ago
2003
Springer
In this paper we investigate principles of the representation of time and modality in terms of conceptual graphs. Based on the works of A. N. Prior, and C. S. Peirce, we suggest a ...
MICS
2010
13 years 2 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
IJAC
2008
13 years 7 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
CPM
1994
Springer
13 years 11 months ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
ICTAI
2000
IEEE
13 years 12 months ago
2000
IEEE
In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial con...