]> mj.ucw.cz Git - ga.git/commit
projects / ga.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: f7175bf) | patch
Prepsan popis algoritmu pro maximalni parovani v regularnich bip. grafech.
authorMartin Mares <mj@ucw.cz>
Thu, 23 Oct 2008 11:08:33 +0000 (13:08 +0200)
committerMartin Mares <mj@ucw.cz>
Thu, 23 Oct 2008 11:08:33 +0000 (13:08 +0200)
commit9caf01a8298a65d9ff4e7e40c9dd61cb6fb60c1d
tree43f3e5e0b7d6b349698fe52b529d4b5cf752cefdtree | snapshot
parentf7175bf1b61778276d4d6704f525b406eac6b86dcommit | diff
Prepsan popis algoritmu pro maximalni parovani v regularnich bip. grafech.

Ted by mel byt srozumitelnejsi; navic jsem prejmenoval Degree Split
na lepe znejici stepeni grafu.
3-bipcon/3-bipcon.tex diff | blob | history
Skripticka Krajinou grafovych algoritmu