Sciweavers

1402 search results - page 30 / 281
» Searching Cycle-Disjoint Graphs
Sort
View
AIPS
2008
14 years 9 hour ago
In Search of the Tractability Boundary of Planning Problems
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
Omer Giménez, Anders Jonsson
IFIP12
2009
13 years 7 months ago
Revealing Paths of Relevant Information in Web Graphs
In this paper we propose a web search methodology based on the Ant Colony Optimization (ACO) algorithm, which aims to enhance the amount of the relevant information in respect to a...
Georgios Kouzas, Vassilis Kolias, Ioannis Anagnost...
PVLDB
2010
152views more  PVLDB 2010»
13 years 8 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
AAAI
2007
14 years 10 hour ago
Discovering Near Symmetry in Graphs
Symmetry is a widespread phenomenon that can offer opportunities for powerful exploitation in areas as diverse as molecular chemistry, pure mathematics, circuit design, biology an...
Maria Fox, Derek Long, Julie Porteous
FAW
2009
Springer
180views Algorithms» more  FAW 2009»
14 years 4 months ago
Edge Search Number of Cographs in Linear Time
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...
Pinar Heggernes, Rodica Mihai