We consider a graph whose vertices are legally colored using k colors and ask if the graph contains a k-clique. As it turns out this very special type of k-clique problem is in an intimate connection with constructing schedules. The practicality this clique search based construction of schedules is checked by carrying out numerical experiments.
ProCite
RefWorks
Reference Manager
BibTeX
Zotero
EndNote
-
[1]
BALAS, E. Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Operation Research 17 (1969), 941–957.
-
[2]
BOMZE, I. M., BUDINICH, M., PARDALOS P. M., AND PELILLO, M. The Maximum Clique Problem, Handbook of Combinatorial Optimization Vol. 4, Kluwer Academic Publisher, 1999.
-
[3]
BUTZ, L., HAMMER, P. L., AND HAUSSMANN, D. Reduction methods for the vertex packing problem. Proceedings of the 17th Conference on Probability Theory. Brassov, 1982, VNU Science Press Utrecht 1985, pp. 73–79.
-
[4]
CARRAGHAN, R., PARDALOS, P. M., An exact algorithm for the maximum clique problem. Opera-tion Research Letters 9 (1990), 375–382.
-
[5]
GAREY, M. R. AND JOHNSON, D. S. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York, 2003.
-
[6]
HASSELBERG, J., PARDALOS, P. M., AND VAIRAKTARAKIS, G. Test case generators and compu-tational results for the maximum clique problem. Journal of Global Optimization 3 (1993), 463–482. http://www.springerlink.com/content/p2m65n57u657605n
-
[7]
HEGYHÁTI, M., HOCZINGER, T., AND ŐSZ, O. Addressing storage time restrictions in the S-graph scheduling framework. Optimization and Engineering (2020).
-
[8]
JURISCH, B., KUBIAK, W., AND JÓZEFOWSKA, J. Algorithms for minclique scheduling problems. Discrete Applied Mathematics 72 (1997), 115–139.
-
[9]
KONC, J., AND JANE IČ, D. An improved branch and bound algorithm for the maximum clique problem. MATCH Communications in Mathematical and Computer Chemistry 58 (2007), 569–590.
-
[10]
KUMLANDER, D. Some Practical Algorithms to Solve the Maximal Clique Problem. PhD. Thesis, Tallin University of Technology, 2005.
-
[11]
ÖSTERGÅRD, P. R. J. A fast algorithm for the maximum clique problem. Discrete Applied Math-ematics 120 (2002), 197–207.
-
[12]
PAPADIMITRIOU, C. H. Computational Complexity. Addison-Wesley Publishing Company, Inc., Reading, MA 1994.
-
[13]
SANMARTÍ, E. PUIGJANER, L., HOLCZINGER, T., AND FRIEDLER, F. Combinatorial framework for effective scheduling of multipurpose batch plants. Process System Engineering 48 (2002), 2557–2570.
-
[14]
SZABÓ, S. Parallel algorithms for finding cliques in a graph. Journal of Physics: Conference Series 268 (2011) 012030.
-
[15]
SZABÓ, S. AND ZAVÁLNIJ, B. Edge coloring of graphs, uses, limitation, complexity. Acta Uni-versitatis Sapientiae, Informatica 8 (2016), 63–81.
-
[16]
TOMITA E. AND SEKI, T. An efficient branch-and-bound algorithm for finding a maximum clique. Lecture Notes in Computer Science 2631 (2003), 278–289.
Editor in Chief: László TÓTH (University of Pécs)
Honorary Editors in Chief:
- † István GYŐRI (University of Pannonia, Veszprém)
- János PINTZ (Rényi Institute of Mathematics)
- Ferenc SCHIPP (Eötvös University Budapest and University of Pécs)
- Sándor SZABÓ (University of Pécs)
Deputy Editors in Chief:
- Erhard AICHINGER (JKU Linz)
- Ferenc HARTUNG (University of Pannonia, Veszprém)
- Ferenc WEISZ (Eötvös University, Budapest)
Editorial Board
- György DÓSA (University of Pannonia, Veszprém)
- István BERKES (Rényi Institute of Mathematics)
- Károly BEZDEK (University of Calgary)
- Balázs KIRÁLY – Managing Editor (University of Pécs)
- Vedran KRCADINAC (University of Zagreb)
- Željka MILIN ŠIPUŠ (University of Zagreb)
- Margit PAP (University of Pécs)
- Mihály PITUK (University of Pannonia, Veszprém)
- Jörg THUSWALDNER (Montanuniversität Leoben)
- Zsolt TUZA (University of Pannonia, Veszprém)
Advisory Board
- Szilárd RÉVÉSZ (Rényi Institute of Mathematics) - Chair
- Gabriella BÖHM (Akadémiai Kiadó, Budapest)
- György GÁT (University of Debrecen)
University of Pécs,
Faculty of Sciences,
Institute of Mathematics and Informatics
Department of Mathematics
7624 Pécs, Ifjúság útja 6., HUNGARY
(36) 72-503-600 / 4179
ltoth@gamma.ttk.pte.hu
- Mathematical Reviews
- Zentralblatt
- DOAJ
| Publication Model | Gold Open Access |
| Submission Fee | none |
| Article Processing Charge | 0 EUR/article (temporarily) |
| Subscription Information | Gold Open Access |
| Mathematica Pannonica | |
|---|---|
| Language | English |
| Size | A4 |
| Year of Foundation |
1990 |
| Volumes per Year |
1 |
| Issues per Year |
2 |
| Founder | Akadémiai Kiadó |
| Founder's Address |
H-1117 Budapest, Hungary 1516 Budapest, PO Box 245. |
| Publisher | Akadémiai Kiadó |
| Publisher's Address |
H-1117 Budapest, Hungary 1516 Budapest, PO Box 245. |
| Responsible Publisher |
Chief Executive Officer, Akadémiai Kiadó |
| ISSN | 2786-0752 (Online) |
| ISSN | 0865-2090 (Print) |
Monthly Content Usage
| Abstract Views | Full Text Views | PDF Downloads | |
|---|---|---|---|
| Oct 2022 | 0 | 0 | 0 |
| Nov 2022 | 0 | 0 | 0 |
| Dec 2022 | 0 | 0 | 0 |
| Jan 2023 | 0 | 0 | 0 |
| Feb 2023 | 0 | 0 | 0 |
| Mar 2023 | 0 | 54 | 20 |
| Apr 2023 | 0 | 0 | 0 |
Copyright Akadémiai Kiadó
AKJournals is the trademark of Akadémiai Kiadó's journal publishing business branch.
Copyright Akadémiai Kiadó AKJournals is the trademark of Akadémiai Kiadó's journal publishing business branch.
Powered by PubFactory