Sciweavers

721 search results - page 115 / 145
» Almost universal graphs
Sort
View
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
15 years 8 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
NAR
2002
138views more  NAR 2002»
15 years 1 months ago
The KEGG databases at GenomeNet
The Kyoto Encyclopedia of Genes and Genomes (KEGG) is the primary database resource of the Japanese GenomeNet service (http://www.genome.ad.jp/) for understanding higher order fun...
Minoru Kanehisa, Susumu Goto, Shuichi Kawashima, A...
TNN
2010
147views Management» more  TNN 2010»
14 years 8 months ago
Theoretical Model for Mesoscopic-Level Scale-Free Self-Organization of Functional Brain Networks
In this paper we provide theoretical and numerical analysis of a geometric activity flow network model which is aimed at explaining mathematically the scale-free functional graph s...
J. Piersa, Filip Piekniewski, Tomasz Schreiber
PODC
2011
ACM
14 years 4 months ago
Structuring unreliable radio networks
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Na...
DAC
2005
ACM
16 years 2 months ago
Energy optimal speed control of devices with discrete speed sets
We obtain analytically, the energy optimal speed profile of a generic multi-speed device with a discrete set of speeds, to execute a given task within a given time. Current implem...
Ravishankar Rao, Sarma B. K. Vrudhula