Period of time: 2004年2期
Publisher: Elsevier
Founded in: 1971
Total resources: 4
ISSN: 0020-0190
Subject: TP Automation Technology , Computer Technology
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Information Processing Letters,volume 89,issue 2
Menu
The greedy algorithm for domination in graphs of maximum degree 3
Information Processing Letters,volume 89,issue 2 , Vol. 89, Iss. 2, 2004-01 , pp.Finding optimal paths in MREP routing
By Fleischer R., Golin M., Lea C.-T., Wong S. in (2004)
Information Processing Letters,volume 89,issue 2 , Vol. 89, Iss. 2, 2004-01 , pp.A characterization of s-languages
By Fraczak W., Podolak A. in (2004)
Information Processing Letters,volume 89,issue 2 , Vol. 89, Iss. 2, 2004-01 , pp.On the minimum number of negations leading to super-polynomial savings
Information Processing Letters,volume 89,issue 2 , Vol. 89, Iss. 2, 2004-01 , pp.Hardness results and approximation algorithms of k-tuple domination in graphs
By Klasing R., Laforest C. in (2004)
Information Processing Letters,volume 89,issue 2 , Vol. 89, Iss. 2, 2004-01 , pp.List edge multicoloring in graphs with few cycles
Information Processing Letters,volume 89,issue 2 , Vol. 89, Iss. 2, 2004-01 , pp.Optimal algorithm for a special point-labeling problem
By Roy S., Goswami P.P., Das S., Nandy S.C. in (2004)
Information Processing Letters,volume 89,issue 2 , Vol. 89, Iss. 2, 2004-01 , pp.The Log-Rank Conjecture and low degree polynomials
Information Processing Letters,volume 89,issue 2 , Vol. 89, Iss. 2, 2004-01 , pp.