1952 search results - page 82 / 391 » Complete partitions of graphs |
139
click to vote
PKDD
2005
Springer
15 years 9 months ago
2005
Springer
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
145
click to vote
LICS
2003
IEEE
15 years 9 months ago
2003
IEEE
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
158
click to vote
TAMC
2009
Springer
15 years 8 months ago
2009
Springer
Because of irreversibility of movements, motion planning on directed graphs is much more intricate than that on graphs. Recently we showed that the feasibility of motion planning o...
131
click to vote
ACL
1993
15 years 5 months ago
1993
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
145
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...