论文信息 - Classes of graphs critical for the edge list-ranking problem - 字舞流文

Classes of graphs critical for the edge list-ranking problem

D. Malyshev | D. S. Malyshev

[1] Dariusz Dereniowski,et al. Edge ranking of weighted trees , 2006, Discret. Appl. Math..

[2] V. E. Alekseev,et al. On easy and hard hereditary classes of graphs with respect to the independent set problem , 2003, Discret. Appl. Math..

[3] Toshihide Ibaraki,et al. Minimum Edge Ranking Spanning Trees of Threshold Graphs , 2002, ISAAC.

[4] Joseph W. H. Liu. The role of elimination trees in sparse factorization , 1990 .

[5] Charles E. Leiserson,et al. Area-Efficient Graph Layouts (for VLSI) , 1980, FOCS.

[6] Dariusz Dereniowski,et al. The Complexity of List Ranking of Trees , 2008, Ars Comb..