Sciweavers

394 search results - page 25 / 79
» Testing subgraphs in large graphs
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
15 years 11 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
DAM
2008
90views more  DAM 2008»
14 years 11 months ago
Polarity of chordal graphs
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
Tinaz Ekim, Pavol Hell, Juraj Stacho, Dominique de...
118
Voted
IJMMS
2007
166views more  IJMMS 2007»
14 years 11 months ago
Visualization of large networks with min-cut plots, A-plots and R-MAT
What does a ‘normal’ computer (or social) network look like? How can we spot ‘abnormal’ sub-networks in the Internet, or web graph? The answer to such questions is vital f...
Deepayan Chakrabarti, Christos Faloutsos, Yiping Z...
FOCS
1999
IEEE
15 years 3 months ago
Efficient Testing of Large Graphs
Noga Alon, Eldar Fischer, Michael Krivelevich, Mar...
CIKM
2009
Springer
15 years 3 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng