Sciweavers

9532 search results - page 439 / 1907
» Logic, Graphs, and Algorithms
Sort
View
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
16 years 29 days ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
ACL
2010
15 years 4 months ago
Experiments in Graph-Based Semi-Supervised Learning Methods for Class-Instance Acquisition
Graph-based semi-supervised learning (SSL) algorithms have been successfully used to extract class-instance pairs from large unstructured and structured text collections. However,...
Partha Pratim Talukdar, Fernando Pereira
157
Voted
EGH
2009
Springer
15 years 4 months ago
Fast minimum spanning tree for large graphs on the GPU
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
Vibhav Vineet, Pawan Harish, Suryakant Patidar, P....
199
Voted
PODC
2006
ACM
16 years 25 days ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
191
Voted
COMPGEOM
2010
ACM
15 years 12 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...