EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Novel and Practical Algorithmic Enhancement for Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs

Cheng Chen, Faisal N. Abu-Khzam, Levente Dojcsak, Michael A. Langston

Algorithms · 25.04.2026 · 19 (5) · 333

DOI: 10.3390/a19050333 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algorithms, online erschienen am 25.04.2026. Verfasst von Cheng Chen und 3 weiteren Autor:innen. Die Arbeit nennt 23 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: NIH, EPA.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A k-partite graph is one whose vertices can be partitioned into k disjoint partite sets, with edges allowed between but not within these sets. In such a graph, a maximal k-partite clique is a subgraph with at least one vertex from each partite set and every allowable edge such that the subgraph cannot be enlarged by the incorporation of additional vertices. A maximum k-partite clique is of course a maximal k-partite clique of the greatest size. The results reported here describe a novel and practical modification of the best previously published algorithm for the enumeration of these special subgraphs. The relative performance of this new method relies on implicit edge addition and search tree pruning and is evaluated on graphs constructed from both pseudorandom and real-world data.

Förderung

  • NIH
  • EPA

Zitieren

APA

Chen, C., Abu-Khzam, F. N., Dojcsak, L., & Langston, M. A. (2026). A Novel and Practical Algorithmic Enhancement for Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs. Algorithms, 19(5), 333. https://doi.org/10.3390/a19050333

Vancouver

Chen C, Abu-Khzam FN, Dojcsak L, Langston MA. A Novel and Practical Algorithmic Enhancement for Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs. Algorithms. 2026;19(5):333. doi:10.3390/a19050333

BibTeX
@article{Chen2026,
  author = {Chen, Cheng and Abu-Khzam, Faisal N. and Dojcsak, Levente and Langston, Michael A.},
  title = {A Novel and Practical Algorithmic Enhancement for Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs},
  journal = {Algorithms},
  year = {2026},
  volume = {19},
  number = {5},
  pages = {333},
  doi = {10.3390/a19050333}
}
Kostenlos starten →