192 search results - page 25 / 39 » On Graph Isomorphism for Restricted Graph Classes |
116
click to vote
AGTIVE
2003
Springer
15 years 5 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
100
click to vote
MP
1998
14 years 11 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
UC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
117
click to vote
RTAS
1998
IEEE
15 years 4 months ago
1998
IEEE
In the past, environmental restrictions on size, weight, and power consumption have severely limited both the processing and storage capacity of embedded signal processing systems...
COMMA
2008
15 years 1 months ago
2008
An abstract framework for formalising persuasion dialogues has recently been proposed. The framework provides for a range of speech acts, and protocols of varying levels of flexibi...