Sciweavers

1215 search results - page 192 / 243
» Combinatorics
Sort
View
COCOON
2007
Springer
15 years 3 months ago
On the Hardness of Optimization in Power Law Graphs
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...
Alessandro Ferrante, Gopal Pandurangan, Kihong Par...
COCOON
2007
Springer
15 years 3 months ago
Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games
In this paper, we give linear time algorithms to decide core stability, core largeness, exactness, and extendability of flow games on uniform networks (all edge capacities are 1)....
Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun
COCOON
2007
Springer
15 years 3 months ago
On the Complexity of Finding an Unknown Cut Via Vertex Queries
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigi...
CPM
2007
Springer
102views Combinatorics» more  CPM 2007»
15 years 3 months ago
Improved Sketching of Hamming Distance with Error Correcting
We address the problem of sketching the hamming distance of data streams. We present a new notion of sketching technique, Fixable sketches and we show that using such sketch not o...
Ely Porat, Ohad Lipsky
CPM
2007
Springer
185views Combinatorics» more  CPM 2007»
15 years 3 months ago
Algorithms for Computing the Longest Parameterized Common Subsequence
In this paper, we revisit the classic and well-studied longest common subsequence (LCS) problem and study some new variants, first introduced and studied by Rahman and Iliopoulos ...
Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahm...