A5100323769- Advanced Graph Theory Research
- Data Management and Algorithms
- Complexity and Algorithms in Graphs
- Constraint Satisfaction and Optimization
- Graph Theory and Algorithms
- Simulation and Modeling Applications
- Computational Geometry and Mesh Generation
- Computer Graphics and Visualization Techniques
- Software Testing and Debugging Techniques
- Robotic Path Planning Algorithms
- Combustion and flame dynamics
- Human Motion and Animation
- Evacuation and Crowd Dynamics
Henan University of Technology
2010-2023
Beihang University
2014-2015
Ministry of Education of the People's Republic of China
2015
As a basic problem in graph theory, the minimum cut (min-cut) has important applications communication related researches. There are injections from set of all traversal trees to cuts. However, this kind injection is completely ignored existing methods, which may lead lose acceleration opportunity. Accordingly, we propose Traversal Tree-Cut Injection based Min-Cut Acceleration algorithm (TCMA). By collecting enough cuts different an undirected graph, upper bound min-cut value between any...
Some algorithms and statistics of the vertex-cover solution space on bipartite graphs are investigated in this paper. Based 's theorem, an exact algorithm for expression is proposed some statistical analysis nodes' states provided. The results fit well with algorithmic ones before emergence unfrozen core, which leads to fluctuations quantities produces replica symmetric breaking solutions. Besides, entropy clustering bipartite-graph solutions calculated using cycle simplification technique...
Counting the solution number of combinational optimization problems is an important topic in study computational complexity, which concerned with Vertex-Cover this paper. First, we investigate organizations spaces by underlying connectivity unfrozen vertices and provide facts on global local environment. Then, a Solution Number Algorithm proposed its complexity analysis provided, results fit very well simulations have better performance than those 1-RSB neighborhood c = e for random graphs....
We focus the solution space of a most fundamental problem - Minimum Vertex-Cover in theoretical computer science. After some rigorous analysis, we provide formation mechanism minimum vertex-cover solutions on tree and give organization these arbitrary lattice structure. By results, can easily calculate numbers structures have better understanding hardness problem. The proposed study algorithm make new way detecting essential difficulty NP-complete problems designing efficient algorithms solving them.
To realize the fire and human behavior simulation, texture mapping particle system technologies were used to achieve realistic scene visualization of inner architecture, advanced skeleton animation technology is simulation evacuation fighting training behavior, combining with mathematical physics method establish more authentic blaze model. The based on 3D real-time rendering includes: virtual buildings, escape rescue characters. At last, realized PC platform gets good effect.