Sciweavers

4865 search results - page 357 / 973
» The Complexity of Graph Connectivity
Sort
View
180
Voted
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 11 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
MICCAI
2000
Springer
15 years 10 months ago
Interactive Organ Segmentation Using Graph Cuts
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...
Yuri Boykov, Marie-Pierre Jolly
COMPGEOM
2008
ACM
15 years 8 months ago
Polychromatic colorings of plane graphs
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
Noga Alon, Robert Berke, Kevin Buchin, Maike Buchi...
CORR
2010
Springer
119views Education» more  CORR 2010»
15 years 6 months ago
Graph-Constrained Group Testing
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
Mahdi Cheraghchi, Amin Karbasi, Soheil Mohajer, Ve...
COMBINATORICA
2006
137views more  COMBINATORICA 2006»
15 years 6 months ago
Extremal Problems For Transversals In Graphs With Bounded Degree
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
Tibor Szabó, Gábor Tardos