Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Re^2: decomposing binary matrices (2)

by hv (Parson)
on Feb 27, 2007 at 21:01 UTC ( #602387=note: print w/replies, xml ) Need Help??

in reply to Re: decomposing binary matrices (2)
in thread decomposing binary matrices (2)

Ah yes, I think I understand - I'd looked at the perfect match algorithm before, but discarded it then because at the time I was trying to solve the splitting problem for which I needed specifically a cycle, and it looked like extending the algorithm to require a cycle was going to degenerate it into something no better than the brute force.

If I'm no longer looking for a cycle, then I can probably use that algorithm. I'll give it a go, and come back.

Update: I *do* understand now. I had read your approach as "to check the edge uv, remove the edge and check ...", but eventually worked out that couldn't be right, that I had to remove the two vertices instead.

What's more, thinking about it in the graph form it is clear to me that after cleanup the split also becomes trivial - the graph simply falls apart into disconnected subgraphs.



Log In?

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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (3)
As of 2021-12-05 14:31 GMT
Find Nodes?
    Voting Booth?
    R or B?

    Results (31 votes). Check out past polls.