6 search results - page 1 / 2 » Signed analogs of bipartite graphs |
DM
1998
13 years 4 months ago
1998
We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even length, under seven different criteria for si...
SDM
2010
SIAM
13 years 6 months ago
2010
SIAM
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
ASPDAC
2007
ACM
13 years 8 months ago
2007
ACM
A new graph reduction approach to symbolic circuit analysis is developed in this paper. A Binary Decision Diagram (BDD) mechanism is formulated, together with a specially designed ...
ECAI
2008
Springer
13 years 6 months ago
2008
Springer
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...