Sciweavers

128 search results - page 12 / 26
» Isomorphic Subgraphs
Sort
View
STACS
2001
Springer
14 years 1 months ago
Evasiveness of Subgraph Containment and Related Properties
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
Amit Chakrabarti, Subhash Khot, Yaoyun Shi
RECOMB
2007
Springer
14 years 9 months ago
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
The study of biological networks and network motifs can yield significant new insights into systems biology. Previous methods of discovering network motifs ? network-centric subgra...
Joshua A. Grochow, Manolis Kellis
IDA
2007
Springer
13 years 8 months ago
Inference of node replacement graph grammars
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
JCT
2010
135views more  JCT 2010»
13 years 7 months ago
Countable connected-homogeneous graphs
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
Robert Gray, D. Macpherson
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
14 years 9 months ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul