Drawing Hypergraphs in Hyperedge’s Average Degree and Multi-Rules

Jun Jia; Xiao Yuan He; Xiao Feng Hu

doi:10.4028/www.scientific.net/AMM.713-715.1682

Paper Titles

Cleaning Uncertain Database with Aggregate Constraints Based on the Modified Simulated Annealing Algorithm
p.1661

Collision Simulation to Road Safety Barrel Based on LS-DYNA
p.1665

Crop Disease Leaf Image Segmentation Based on Genetic Algorithm and Maximum Entropy
p.1670

Digital Audio Watermarking Based on QR Decomposition and Dither-Modulation Quantization
p.1675

Drawing Hypergraphs in Hyperedge’s Average Degree and Multi-Rules
p.1682

Electropalatographic Parameter Analysis of Single Consonant of Xiahe Tibetan Dialects
p.1689

EL-SVDD: An Improved and Localized Multi-Class Classification Algorithm
p.1693

Energy Minimization Model Based Target Tracking
p.1699

Energy-Saving Scheduling Algorithm of Public Transport Bus Based on Passenger Flow Distribution in Different Time
p.1703

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 713-715Drawing Hypergraphs in Hyperedge’s Average Degree...

Drawing Hypergraphs in Hyperedge’s Average Degree and Multi-Rules

Abstract:

By analysing the past algorithms of drawing hypergraphs, this paper gives the definition of hyper graphs’ vertex degree and hyperedge’s average degree at first. Then it introduces the flow of this algorithm and particularly describes the rule set in setting the position of the vertex and the principal of minimum envelop law in drawing the hyperedge, and the complexity of this algorithm is analyzed. At last it draws a hypergraphs of scientific collaboration network successfully based on this algorithm and the result proves that the drawing algorithm of hyper graphs based on hyper edge’s average degree and multi-rules is feasible.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 713-715)

Pages:

1682-1688

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.713-715.1682

Citation:

Cite this paper

Online since:

January 2015

Authors:

Jun Jia*, Xiao Yuan He, Xiao Feng Hu

Keywords:

Constraint Rule Set, Hyperedge’s Average Degree, Hypergraphs, Vertex Degree

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Berge C. Graphs and Hypergraphs[M]. New York: Elsevier, (1973).

Google Scholar

[2] D. S. Johnson and H. O. Pollak. Hypergraph planarity and the complexity of drawing venn diagrams[J]. Journal of Graph Theory. (1987).

DOI: 10.1002/jgt.3190110306

Google Scholar

[3] E. Makinen. How to draw a hypergraph[J]. International Journal of Computer Mathematics. (1990).

Google Scholar

[4] H. Klemetti, I. Lapinleimu, E. Makinen, M. Sieranta. A programming project: Trimming the spring algorithm for drawing hypergraphs. SIGCSE Bulletin, 27(3): 34-38, (1995).

DOI: 10.1145/209849.209855

Google Scholar

[5] Bertault. F, Eades. P. Drawing hypergraphs in the subset standard. In: Marks. J. (ed. ) GD 2000. LNCS, vol. 1984, p.164–169. Springer, Heidelberg (2001).

DOI: 10.1007/3-540-44541-2_15

Google Scholar

[6] Hubert de Fraysseix, Patrice Ossona de Mendez, and Pierre Rosenstiehl. Representation of Planar Hypergraphs by Contacts of Triangles. S. -H. Hong, T. Nishizeki, and W. Quan (Eds. ): GD 2007, LNCS 4875, p.125–136, (2007).

DOI: 10.1007/978-3-540-77537-9_15

Google Scholar

[7] Michael Kaufmann, Marc van Kreveld, and Bettina Speckmann. Subdivision Drawings of Hypergraphs. I.G. Tollis and M. Patrignani (Eds. ): GD 2008, LNCS 5417, p.396–407, (2009).

DOI: 10.1007/978-3-642-00219-9_39

Google Scholar

[8] WANG Jian-fang. TW0 PR0BLEMS IN HYPERGRAPHS[J]. J Sys Scis & Math Scis. 29(11) (2009, 11), 1457-1459.

Google Scholar

[9] Hu Feng, Zhao Hai-Xing, He Jia-Bei, Li Fa-Xu, Li Shu-Ling, Zhang Zi-Ke. An evolving model for hypergraph-structure-based scientific collaboration networks[J]. Vol. 62, No. 19(2013).

DOI: 10.7498/aps.62.198901

Google Scholar