# On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph

##### Citations

^{1}, Brad Abbott

^{2}, Jalal Abdallah

^{3}, Ovsat Abdinov

^{4}+2841 more•Institutions (194)

200 citations

### Cites methods from "On a New Approach for Finding All t..."

...The selected tracks are used to construct a multitrack DV by means of an algorithm based on the incompatibilitygraph approach [55]....

[...]

152 citations

### Cites methods from "On a New Approach for Finding All t..."

...In order to resolve such ambiguities, an iterative process based on the incompatibility graph approach [75] is applied....

[...]

93 citations

81 citations

74 citations

### Cites methods from "On a New Approach for Finding All t..."

...An algorithm that solves this problem is given by Das 1973 ....

[...]

##### References

524 citations

### "On a New Approach for Finding All t..." refers methods in this paper

...Borrowing the concept ofcut-set fromgraphtheory[ 17 ], amodified cut-set wasdefined inthefollowing way....

[...]

^{1}

305 citations

### "On a New Approach for Finding All t..." refers background in this paper

...Fig. 2 . Incompatibility graphoffive elements....

[...]

...Intheareaofsequential switching theory, forthe minimization ofincompletely specified sequential machines, akindofbinary relation R,called thecompatibility relation between thedifferent ordered pairsof internal states, isdefined [ 2 ]-[14]....

[...]

...Theorem 2 :Inanedge-inclusion table corresponding toanincompatibility grapheverycolumncontains two andonlytwonodes....

[...]

...elements consist ofk different isolated subgraphs I,, 12,**,Ik,whereeachsubgraph 1i, i=1, 2 ,....

[...]

...Thetotal numberofedgesinthesubgraphisn(n-1)/ 2 . A complete subgraph Cmofasymmetric graphC isamaximalcomplete subgraph ifand onlyifthere doesnotexist anynodeinCoutside ofthe subgraph Cmwhichisadjacent toallthenodesofCm....

[...]

285 citations

163 citations

125 citations

### "On a New Approach for Finding All t..." refers background in this paper

...Another interesting exampleinwhichanidentical typeofcompatibility relation occurs isinconnection withscheduling oftraffic lights whereanimportant problem istodetermine themaximum flowoftraffic through anintersection during the various traffic light phases[ 16 ]....

[...]