Sciweavers

677 search results - page 6 / 136
» Bipartite roots of graphs
Sort
View
JCT
2010
135views more  JCT 2010»
13 years 5 months ago
Countable connected-homogeneous graphs
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
Robert Gray, D. Macpherson
AAAI
2007
13 years 9 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Ole J. Mengshoel
SIGECOM
2010
ACM
153views ECommerce» more  SIGECOM 2010»
13 years 5 months ago
Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads
We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to repr...
Denis Charles, Max Chickering, Nikhil R. Devanur, ...
HCI
2007
13 years 8 months ago
Anchored Maps: Visualization Techniques for Drawing Bipartite Graphs
A method of drawing anchored maps for bipartite graphs is presented. Suppose that the node set of a bipartite graph is divided into set A and set B. On an anchored map of the bipar...
Kazuo Misue
APVIS
2006
13 years 8 months ago
Drawing bipartite graphs as anchored maps
A method of drawing anchored maps for bipartite graphs is presented. Suppose that the node set of a bipartite graph is divided into set A and set B. On an anchored map of the bipa...
Kazuo Misue