Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re^2: decomposing binary matrices

by hv (Parson)
on Feb 17, 2007 at 13:30 UTC ( #600602=note: print w/ replies, xml ) Need Help??

in reply to Re: decomposing binary matrices
in thread decomposing binary matrices

Thinking about this further last night, I can refine the requirement to finding: that union of cyclic alternating paths which puts each node in the longest possible cycle. This page you referenced uses the discovery of alternating paths at the core of its algorithm - I need to analyse it further to see if it can be extended to discern the longest cycles.

I was perhaps overly swayed by reading that the problem of "finding the longest cycle" is NP-hard - that is for a general graph, and it seems entirely possible that the special case of a bipartite graph introduces enough structure to make it rather easier.


Comment on Re^2: decomposing binary matrices

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://600602]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (12)
As of 2015-10-06 19:01 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (158 votes), past polls