Sciweavers

4201 search results - page 227 / 841
» Interaction graphs: Additives
Sort
View
ALGORITHMICA
2010
127views more  ALGORITHMICA 2010»
15 years 6 months ago
An Algorithm for Minimum Cost Arc-Connectivity Orientations
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
Satoru Iwata, Yusuke Kobayashi
TCS
2008
15 years 6 months ago
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
Anne Berry, Elias Dahlhaus, Pinar Heggernes, Genev...
NAR
2008
101views more  NAR 2008»
15 years 5 months ago
RNALogo: a new approach to display structural RNA alignment
Regulatory RNAs play essential roles in many essential biological processes, ranging from gene regulation to protein synthesis. This work presents a web-based tool, RNALogo, to cr...
Tzu-Hao Chang, Jorng-Tzong Horng, Hsien-Da Huang
JCO
2011
113views more  JCO 2011»
15 years 1 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
CVPR
1999
IEEE
16 years 8 months ago
Stochastic Image Segmentation by Typical Cuts
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...
Yoram Gdalyahu, Daphna Weinshall, Michael Werman