677 search results - page 4 / 136 » Bipartite roots of graphs |
CORR
2010
Springer
15 years 15 days ago
2010
Springer
Whiteley [9] gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined gr...
93
Voted
SIAMDM
2008
15 years 10 days ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
COMBINATORICA
1999
15 years 3 days ago
1999
We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite or far from being bipartite. Graphs are represented by incidence lists of bounded len...
136
click to vote
AI
2010
Springer
15 years 17 days ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
COMBINATORICA
2006
15 years 14 days ago
2006
In this paper we show that, if G is a Berge graph such that neither G nor its complement G contains certain induced subgraphs, named proper wheels and long prisms, then either G i...