Searching for "Recognizing Balanceable Matrices." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Maximum H-Colourable Subgraph Problem in Balanced Graphs
by Elias Dahlhaus, Paul D. Manuel, Mirka Miller — 1996 — Information Processing Letters
…. al. [CCKV94] have given a polynomial time algorithm to recognize balanced matrices. The clique matrix…
Cited by 4 (1 self) – Add To MetaCart

A polynomial recognition algorithm for balanced matrices
by Giacomo Zambelli — 2003 — Journal of Combinatorial Theory, Series B
… in [3] could also be applied to the problem of recognizing balanced matrices, to design algorithms…
Cited by 2 (1 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB