1172 search results - page 134 / 235 » Path Algorithms on Regular Graphs |
131
click to vote
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Query logs record the queries and the actions of the users of search engines, and as such they contain valuable information about the interests, the preferences, and the behavior ...
93
Voted
GD
2004
Springer
15 years 6 months ago
2004
Springer
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
110
Voted
GD
1999
Springer
15 years 4 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
101
Voted
JAL
2006
15 years 18 days ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
120
click to vote
ALGORITHMICA
2008
15 years 23 days ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...