Related content

Node packings on cocomparability graphs

By Barcia P.   Cerdeira J.O.  

Operations Research Letters, Vol. 31, Iss. 5, 2003-09 ,pp. : 341-342

Elsevier

Access to resources Recommend Favorite

Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs

By Fan Neng  

Journal of Combinatorial Optimization, Vol. 23, Iss. 2, 2012-02 ,pp. : 224-251

Springer Publishing Company

Access to resources Recommend Favorite

Maximum Directed Cuts in Graphs with Degree Constraints

By Xu Baogang  

Graphs and Combinatorics, Vol. 28, Iss. 4, 2012-07 ,pp. : 563-574

Springer Publishing Company

Access to resources Recommend Favorite

Cuts, Trees and l₁-Embeddings of Graphs*

By Gupta† Anupam   Newman Ilan   Rabinovich Yuri   Sinclair‡ Alistair  

Combinatorica, Vol. 24, Iss. 2, 2004-04 ,pp. : 233-269

Springer Publishing Company

Access to resources Recommend Favorite

Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs

By Wang Qingning   Xiong Liming  

International Journal of Computer Mathematics, Vol. 91, Iss. 7, 2014-07 ,pp. : 1385-1396

Taylor & Francis Ltd

Access to resources Recommend Favorite