Sciweavers

2125 search results - page 89 / 425
» On Graph Complexity
Sort
View
COCOON
2006
Springer
13 years 11 months ago
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
Min Chih Lin, Jayme Luiz Szwarcfiter
DATESO
2004
134views Database» more  DATESO 2004»
13 years 9 months ago
Designing Indexing Structure for Discovering Relationships in RDF Graphs
Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing -operators into RDF quer...
Stanislav Barton
DAM
2007
105views more  DAM 2007»
13 years 7 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
ACCV
2009
Springer
14 years 2 months ago
Iterated Graph Cuts for Image Segmentation
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
Bo Peng, Lei Zhang, Jian Yang
CSL
2007
Springer
14 years 1 months ago
Clique-Width and Parity Games
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
Jan Obdrzálek