Result 1 to 10 of 10 total
Hardness complexity of optimal substructure problems on power-law graphs. (English)
Thai, My T. (ed.) et al., Handbook of optimization in complex networks. Theory and applications. New York, NY: Springer (ISBN 978-1-4614-0753-9/hbk; 978-1-4614-0754-6/ebook). Springer Optimization and Its Applications 57, 255-277 (2012).
1
Optimization problems in multiple subtree graphs. (English)
Discrete Appl. Math. 159, No. 7, 588-594 (2011).
2
Linear time algorithms on circular-arc graphs. (English)
Inf. Process. Lett. 40, No.3, 123-129 (1991).
3
Parallel algorithms for cographs recognition and applications. (English)
Algorithms and data structures, Proc. workshop WADS ’89, Ottawa/Canada 1989, Lect. Notes Comput. Sci. 382, 335-351 (1989).
4
NC algorithms for circular-arc graphs. (English)
Algorithms and data structures, Proc. workshop WADS ’89, Ottawa/Canada 1989, Lect. Notes Comput. Sci. 382, 291-302 (1989).
5
Some efficient parallel algorithms on interval graphs. (Chinese)
Appl. Math., J. Chin. Univ. 4, No.4, 534-540 (1989).
6
Über die Einschränkung NP-vollständiger Graphenprobleme auf Teilklassen chordaler Graphen. (On the restriction of NP-complete graph problems to subclasses of chordal graphs). (German)
Jena: Friedrich-Schiller-Universität Jena, Math.-Naturwissenschaftlich- Technische Fak., Diss. iv, 91 S. (1989).
7
Dominating sets in social network graphs. (English)
Math. Soc. Sci. 16, No.3, 267-279 (1988).
8
A linear time algorithm for the minimum dominating clique problem on strongly chordal graphs. (English)
Forschungsergeb., Friedrich-Schiller-Univ. Jena N/87/29, 46 p. (1987).
9
Some parallel algorithms on interval graphs. (English)
VLSI: Algorithms and architectures, Proc. Int. Workshop Parallel Comput. VLSI, Amalfi/Italy 1984, 69-78 (1985).
10
Result 1 to 10 of 10 total
Start
Contact
Print
General Help
