Sciweavers

3958 search results - page 30 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
COCOON
2007
Springer
15 years 8 months ago
Improved Exact Algorithms for Counting 3- and 4-Colorings
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh
ICPR
2006
IEEE
16 years 5 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai
SPAA
2005
ACM
15 years 10 months ago
The expansion and mixing time of skip graphs with applications
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
James Aspnes, Udi Wieder
WSDM
2009
ACM
178views Data Mining» more  WSDM 2009»
15 years 11 months ago
User Browsing Graph: Structure, Evolution and Application
This paper focuses on ‘user browsing graph’ which is constructed with users’ click-through behavior modeled with Web access logs. User browsing graph has recently been adopt...
Yiqun Liu, Min Zhang, Shaoping Ma, Liyun Ru