66 search results - page 4 / 14 » Algorithmic Aspects of Property Testing in the Dense Graphs ... |
CMSB
2006
Springer
13 years 10 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
SIAMDM
2008
13 years 6 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
ASUNAM
2011
IEEE
12 years 6 months ago
2011
IEEE
—Modern applications such as web knowledge base, network traffic monitoring and online social networks have made available an unprecedented amount of network data with rich type...
STACS
2007
Springer
14 years 10 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
APSCC
2009
IEEE
14 years 1 months ago
2009
IEEE
What is a cloud application precisely? In this paper, we formulate a computing cloud as a kind of graph, a computing resource such as services or intellectual property access righ...