Finding all k-cliques in k-partite graphs, an application in textile engineering-Reference-Cited by-同舟云学术

Finding all k-cliques in k-partite graphs, an application in textile engineering

Published:2002-01 Issue:1 Volume:29 Page:13-31
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Grünert Tore,Irnich Stefan,Zimmermann Hans-Jürgen,Schneider Markus,Wulfhorst Burkhard

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference25 articles.

1. Computers and Intractability. A Guide to the theory of NP-completeness;Garey,1979

2. Obolenski B, Pickett A. Final report to the BMBF-Project Composites with three-dimensional braided reinforcement. Aachen, 1996.

3. Novel three-dimensional braided structures with continuous transition between different cross-sectional forms;Wulfhorst;Band- und Flechtindustrie,1996

4. Bron C, Kerbosch J. Finding all cliques of an undirected graph. Communications of the ACM 1973;16(9): 575–77.

5. Clique detection for nondirected graphs: two new algorithms;Gerhards;Computing,1979

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ant algorithms for finding weighted and unweighted maximum cliques in d-division graphs;International Journal of Electronics and Telecommunications;2024-06-25

2. Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes;IEEE Transactions on Communications;2023-06

3. Coordinated flight path planning for a fleet of missiles in high-risk areas;Robotica;2023-01-16

4. Algorithms for the clique problem with multiple-choice constraints under a series–parallel dependency graph;Discrete Applied Mathematics;2023-01

5. Ant Colony Optimization Algorithm for Finding the Maximum Number of d-Size Cliques in a Graph with Not All m Edges between Its d Parts;Lecture Notes in Networks and Systems;2023