1736 search results - page 39 / 348 » On antimagic directed graphs |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
BIRTHDAY
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within m...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...