715 search results - page 33 / 143 » On graphs with subgraphs having large independence numbers |
CPC
2007
13 years 7 months ago
2007
In 1972, M. Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere Sd in such a way that two vertices joined by an edge have distance more than √ 3 (i...
CIKM
2010
Springer
13 years 2 months ago
2010
Springer
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
WG
1998
Springer
13 years 11 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
SPAA
2000
ACM
13 years 12 months ago
2000
ACM
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Pattern mining methods for graph data have largely been restricted to ground features, such as frequent or correlated subgraphs. Kazius et al. have demonstrated the use of elaborat...