Sciweavers

394 search results - page 41 / 79
» Testing subgraphs in large graphs
Sort
View
BMCBI
2006
137views more  BMCBI 2006»
13 years 10 months ago
INTEGRATOR: interactive graphical search of large protein interactomes over the Web
Background: The rapid growth of protein interactome data has elevated the necessity and importance of network analysis tools. However, unlike pure text data, network search spaces...
Aaron N. Chang, Jason McDermott, Zachary Frazier, ...
GD
2009
Springer
14 years 2 months ago
On Planar Supports for Hypergraphs
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Be...
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
14 years 4 months ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...
WADS
2007
Springer
91views Algorithms» more  WADS 2007»
14 years 4 months ago
Kernelization and Complexity Results for Connectivity Augmentation Problems
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
Jiong Guo, Johannes Uhlmann
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
14 years 10 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