A Heuristic Algorithm on Solving the Great Group Dividing of Figure

Hai Yan Zhou; Li Ping Wen

doi:10.4028/www.scientific.net/AMM.239-240.1557

Paper Titles

A Kind of Index Technology Based on Binary Tree Efficient Space
p.1537

A Parallel BP Neural Network Based on the FPGA
p.1541

A Fractal Based Subpixel Image Edge Detection Algorithm
p.1546

Research on Intelligent Layout System of Blanking Parts
p.1552

A Heuristic Algorithm on Solving the Great Group Dividing of Figure
p.1557

A Distributed Algorithm Based on RSSI for Intelligent Vehicle Localization
p.1561

Optimized Load Distributed of Power Plant Units Based on Branch and Bound Method
p.1565

Studies on the Coordination Reaction of VO2+ and Tannic Acid in the Tannin Extract Desulfurization
p.1573

The Application of the Non-Ball Mill for Superhard Refractories
p.1577

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 239-240A Heuristic Algorithm on Solving the Great Group...

A Heuristic Algorithm on Solving the Great Group Dividing of Figure

Abstract:

The problem of the great group of a figure is the famous NP-difficult problem. There exists an algorithm of solving the great group of figure or only applying to some of the special figure .There need time price is index level, and is low efficiency. It puts forward a kind of solving the minimax group partition algorithm with the most magnanimous nodes for elicitation information. This algorithm can be applied to any simple figure, and the maximum time complexity of algorithm is O(sn3).

You might also be interested in these eBooks

Measurement Technology and its Application

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 239-240)

Pages:

1557-1560

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.239-240.1557

Citation:

Cite this paper

Online since:

December 2012

Authors:

Hai Yan Zhou, Li Ping Wen

Keywords:

Great Group Division of Figure, Heuristic Algorithm , Minimax Group Partition

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Randy Carraghan, Panos M Pardalos An exect algorithm for the maximum clique Problem Operations Research letters 1990(9):357-383

DOI: 10.1016/0167-6377(90)90057-c

Google Scholar

[2] ZhongCheng, XieLi. An algorithm of solving the biggest group of graph. Journal of software, 1999, 10 (3) 288-292

Google Scholar

[3] HU Gang; XU Ming; LIU Li-Xia.Spectrum Sensing Algorithm Based on Clique Partition for Wireless Cognitive Networks. Journal of Software, 2011,22(2):298-312

DOI: 10.3724/sp.j.1001.2011.03721

Google Scholar