3008 search results - page 271 / 602 » Independence in connected graphs |
175
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
Link analysis methods have been used successfully for knowledge discovery from the link structure of mutually linking entities. Existing link analysis methods have been inherently...
175
click to vote
AUIC
2006
IEEE
16 years 23 days ago
2006
IEEE
We describe a prototype sketch-based system that allows users to draw and manipulate directed graphs using gestural input exclusively. The system incorporates the notion of fluid...
184
click to vote
DALT
2004
Springer
16 years 2 days ago
2004
Springer
In 1992, Moss and Parikh studied a bimodal logic of knowledge and effort called Topologic. In this current paper, Topologic is extended to the case of many agents who are assumed...
174
click to vote
SIGIR
2010
ACM
15 years 10 months ago
2010
ACM
Defining a measure of similarity between queries is an interesting and difficult problem. A reliable query-similarity measure can be used in a variety of applications such as que...
217
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...