Sciweavers

13603 search results - page 8 / 2721
» On the Complexity of Computing Treelength
Sort
View
WAIM
2010
Springer
13 years 5 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le
IGPL
2000
82views more  IGPL 2000»
13 years 7 months ago
The Computational Complexity of Hybrid Temporal Logics
Carlos Areces, Patrick Blackburn, Maarten Marx
DAM
2002
82views more  DAM 2002»
13 years 7 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian