A Study of the Maximum Clique Problem in Dynamic Interval Graphs and Circular-arc Graphs
碩士 === 國立中興大學 === 應用數學研究所 === 83 ===
Main Authors: | kuo_Long Chen, 陳國隆 |
---|---|
Other Authors: | M. S. Yu |
Format: | Others |
Language: | en_US |
Published: |
1995
|
Online Access: | http://ndltd.ncl.edu.tw/handle/80617720216933574537 |
Similar Items
-
Cliques and Clique Covers in Interval-Valued Fuzzy Graphs
by: Napur Patra, et al.
Published: (2021-06-01) -
Efficient Algorithms for the Weighted k-Domination Problem and its Variants on Interval and Circular-arc Graphs
by: Lu, Chin Lung, et al.
Published: (1993) -
Remarks on Parameterized Complexity of Variations of the Maximum-Clique Transversal Problem on Graphs
by: Lee, C.-M
Published: (2022) -
Parallel algorithms for recognizing proper interval graphs and proper circular-arc graphs
by: ZHANG,XIU-JUAN, et al.
Published: (1991) -
Quantum Algorithm for Finding a Maximum Clique in an Undirected Graph
by: Alan Bojić
Published: (2012-12-01)