Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 11, 1982 - Issue 3-4
Submit an article Journal homepage
34
Views
17
CrossRef citations to date
0
Altmetric
Original Articles

Determining the number of internal stability of a graph

E. Loukakis University of Thessalonik, School of Engineering, Thessaloniki, Greece
&
C. Tsouros University of Thessalonik, School of Engineering, Thessaloniki, Greece
Pages 207-220 | Received 01 Jun 1981, Published online: 19 Mar 2007

Citations (17)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (4)

Panos M. Pardalos & Nisha Desai. (1991) An algorithm for finding a maximum weighted independent set in an arbitrary graph. International Journal of Computer Mathematics 38:3-4, pages 163-175.
Read now
P. M. Pardalos & A. T. Phillips. (1990) A global optimization approach for solving the maximum clique problem. International Journal of Computer Mathematics 33:3-4, pages 209-216.
Read now
J-C. Panayiotopoulos. (1989) Using Fifth Generation Tools for Solving the Clique Number Problem. Journal of Information and Optimization Sciences 10:3, pages 535-555.
Read now
E. Loukakis & C. Tsouros. (1983) An algorithm for the maximum internally stable set in a weighted graph. International Journal of Computer Mathematics 13:2, pages 117-129.
Read now

Articles from other publishers (13)

R. Alvarez-Valdes, F. Parreño & J.M. Tamarit. (2005) A branch-and-cut algorithm for the pallet loading problem. Computers & Operations Research 32:11, pages 3007-3029.
Crossref
Missae Yamamoto & Luiz A.N. Lorena. 2005. Metaheuristics: Progress as Real Problem Solvers. Metaheuristics: Progress as Real Problem Solvers 287 302 .
Immanuel M. Bomze, Marco Budinich, Panos M. Pardalos & Marcello Pelillo. 1999. Handbook of Combinatorial Optimization. Handbook of Combinatorial Optimization 1 74 .
Panos M. Pardalos, Thelma Mavridou & Jue Xue. 1999. Handbook of Combinatorial Optimization. Handbook of Combinatorial Optimization 1077 1141 .
Panos M. Pardalos & Jue Xue. (1994) The maximum clique problem. Journal of Global Optimization 4:3, pages 301-328.
Crossref
Federico Della Croce & Roberto Tadei. (1994) A multi-KP modeling for the maximum-clique problem. European Journal of Operational Research 73:3, pages 555-561.
Crossref
Michel Gendreau, Patrick Soriano & Louis Salvail. (1993) Solving the maximum clique problem using a tabu search approach. Annals of Operations Research 41:4, pages 385-403.
Crossref
L. Babel. (1991) Finding maximum cliques in arbitrary and in special graphsBestimmung von Maximum Cliquen in beliebigen und in speziellen Graphen. Computing 46:4, pages 321-341.
Crossref
Randy Carraghan & Panos M. Pardalos. (1990) An exact algorithm for the maximum clique problem. Operations Research Letters 9:6, pages 375-382.
Crossref
L. Babel & G. Tinhofer. (1990) A branch and bound algorithm for the maximum clique problem. ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research 34:3, pages 207-217.
Crossref
C. Friden, A. Hertz & D. de Werra. (1990) Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph. Computers & Operations Research 17:5, pages 437-445.
Crossref
Kathryn A. Dowsland. (1987) An exact algorithm for the pallet loading problem. European Journal of Operational Research 31:1, pages 78-84.
Crossref
Egon Balas & Chang Sung Yu. (1986) Finding a Maximum Clique in an Arbitrary Graph. SIAM Journal on Computing 15:4, pages 1054-1068.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.