Sciweavers

220 search results - page 12 / 44
» Reconstruction Algorithm for Permutation Graphs
Sort
View
IPL
2007
89views more  IPL 2007»
13 years 7 months ago
On the longest path algorithm for reconstructing trees from distance matrices
Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...
Lev Reyzin, Nikhil Srivastava
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
13 years 9 months ago
Reconstruction from Randomized Graph via Low Rank Approximation
The privacy concerns associated with data analysis over social networks have spurred recent research on privacypreserving social network analysis, particularly on privacypreservin...
Leting Wu, Xiaowei Ying, Xintao Wu
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 5 months ago
Optimally Reconstructing Weighted Graphs Using Queries
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
Hanna Mazzawi
ICALP
2005
Springer
14 years 1 months ago
Approximation Algorithms for the Max-coloring Problem
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Sriram V. Pemmaraju, Rajiv Raman
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
14 years 28 days ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara