394 search results - page 16 / 79 » Testing subgraphs in large graphs |
ENDM
2007
13 years 9 months ago
2007
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
WG
2005
Springer
14 years 2 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
IPPS
2010
IEEE
13 years 7 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
DM
2008
13 years 9 months ago
2008
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...