On the Computational Complexity of Matching on Chordal and Strongly Chordal Graphs

作者： Marek Karpinski , Elias Dahlhaus

DOI:

关键词:

摘要:

暂无可下载资源，当前可以选择系统获取到有开放资源时通知我或者直接发起求助文献求助

参考文章(4)

Fabio Tardella, Frits C. R. Spieksma, Maurice Queyranne, A general class of greedily solvable linear programs. integer programming and combinatorial optimization. pp. 385- 399 ,(1993)

David Helmbold, Ernst Mayr, Two Processor Scheduling is in NC Proceedings of the VLSI Algorithms and Architectures, Aegean Worksho on Computing. pp. 12- 25 ,(1986) , 10.1007/3-540-16766-8_2

Fǎnicǎ Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs Journal of Combinatorial Theory, Series B. ,vol. 16, pp. 47- 56 ,(1974) , 10.1016/0095-8956(74)90094-X

Martin Farber, Characterizations of strongly chordal graphs Discrete Mathematics. ,vol. 43, pp. 173- 189 ,(1983) , 10.1016/0012-365X(83)90154-1