Sciweavers

5607 search results - page 410 / 1122
» Graph structure in the Web
Sort
View
AI
2010
Springer
15 years 7 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
ALGORITHMICA
2007
86views more  ALGORITHMICA 2007»
15 years 7 months ago
Detecting Holes and Antiholes in Graphs
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
Stavros D. Nikolopoulos, Leonidas Palios
ICPR
2008
IEEE
16 years 1 months ago
A colour text/graphics separation based on a graph representation
In this paper, a colour text/graphics segmentation is proposed. Firstly, it takes advantage of colour properties by computing a relevant hybrid colour model. Then an edge detectio...
Romain Raveaux, Jean-Christophe Burie, Jean-Marc O...
175
Voted
WG
2007
Springer
16 years 29 days ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
185
Voted
FLAIRS
2007
15 years 9 months ago
Deriving Chronological Information from Texts through a Graph-Based Algorithm
We propose a method of deriving chronological order of events in natural language texts by constraining temporal boundaries associated to events and projecting them on a timeline....
Cosmin Adrian Bejan