966 search results - page 75 / 194 » Small Alliances in Graphs |
CSL
2011
Springer
13 years 3 months ago
2011
Springer
How much can we infer about the pronunciation of a language – past or present – by observing which words its speakers rhyme? This paper explores the connection between pronunc...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in a step-by-step lab...
STOC
2006
ACM
14 years 2 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
FOCS
2004
IEEE
14 years 14 days 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 ...
CGF
2010
13 years 8 months ago
2010
We present a new approach aimed at understanding the structure of connections in edge-bundling layouts. We combine the advantages of edge bundles with a bundle-centric simplified ...