Sciweavers

966 search results - page 76 / 194
» Small Alliances in Graphs
Sort
View
PVLDB
2010
112views more  PVLDB 2010»
13 years 7 months ago
On Triangulation-based Dense Neighborhood Graphs Discovery
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
Nan Wang, Jingbo Zhang, Kian-Lee Tan, Anthony K. H...
GBRPR
2007
Springer
14 years 2 months ago
Approximating TSP Solution by MST Based Graph Pyramid
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
Yll Haxhimusa, Walter G. Kropatsch, Zygmunt Pizlo,...
VLDB
2005
ACM
144views Database» more  VLDB 2005»
14 years 2 months ago
Bidirectional Expansion For Keyword Search on Graph Databases
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
Varun Kacholia, Shashank Pandit, Soumen Chakrabart...
FOCS
1993
IEEE
14 years 27 days ago
Simulated Annealing for Graph Bisection
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
Mark Jerrum, Gregory B. Sorkin
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 10 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos