Sciweavers

5473 search results - page 250 / 1095
» On the graph isomorphism problem
Sort
View
WWW
2009
ACM
16 years 8 months ago
Query clustering using click-through graph
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 ...
Jeonghee Yi, Farzin Maghoul
BIRTHDAY
2010
Springer
16 years 2 months ago
Extended Compact Web Graph Representations
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...
Francisco Claude, Gonzalo Navarro
175
Voted
JGT
2008
97views more  JGT 2008»
15 years 7 months ago
On the oriented chromatic index of oriented graphs
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
Pascal Ochem, Alexandre Pinlou, Eric Sopena
COMBINATORICS
1998
79views more  COMBINATORICS 1998»
15 years 7 months ago
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
Ljiljana Brankovic, Mirka Miller, Ján Plesn...
NHM
2010
87views more  NHM 2010»
15 years 2 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...