18666930. CONSTRUCTION METHOD AND APPARATUS FOR BIPARTITE GRAPH, AND DISPLAY METHOD AND APPARATUS FOR BIPARTITE GRAPH simplified abstract (HUAWEI TECHNOLOGIES CO., LTD.)
Contents
- 1 CONSTRUCTION METHOD AND APPARATUS FOR BIPARTITE GRAPH, AND DISPLAY METHOD AND APPARATUS FOR BIPARTITE GRAPH
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 CONSTRUCTION METHOD AND APPARATUS FOR BIPARTITE GRAPH, AND DISPLAY METHOD AND APPARATUS FOR BIPARTITE GRAPH - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Key Features and Innovation
- 1.6 Potential Applications
- 1.7 Problems Solved
- 1.8 Benefits
- 1.9 Commercial Applications
- 1.10 Prior Art
- 1.11 Frequently Updated Research
- 1.12 Questions about Bipartite Graph Construction and Display
- 1.13 Original Abstract Submitted
CONSTRUCTION METHOD AND APPARATUS FOR BIPARTITE GRAPH, AND DISPLAY METHOD AND APPARATUS FOR BIPARTITE GRAPH
Organization Name
Inventor(s)
Zhongwei Wang of Hangzhou (CN)
CONSTRUCTION METHOD AND APPARATUS FOR BIPARTITE GRAPH, AND DISPLAY METHOD AND APPARATUS FOR BIPARTITE GRAPH - A simplified explanation of the abstract
This abstract first appeared for US patent application 18666930 titled 'CONSTRUCTION METHOD AND APPARATUS FOR BIPARTITE GRAPH, AND DISPLAY METHOD AND APPARATUS FOR BIPARTITE GRAPH
Simplified Explanation
This patent application describes a method and apparatus for constructing and displaying a bipartite graph. The method involves searching a computational graph for cross-communication edges corresponding to communication nodes, cutting these edges, and aggregating the graph to create the bipartite graph.
- The method involves searching a computational graph for cross-communication edges corresponding to communication nodes.
- Cutting these edges that pass through the communication nodes.
- Performing an aggregation operation to obtain the bipartite graph where communication nodes are connected without an edge.
Key Features and Innovation
- Construction method for a bipartite graph.
- Display method for a bipartite graph.
- Identification and cutting of cross-communication edges in a computational graph.
- Aggregation operation to create the bipartite graph.
Potential Applications
This technology can be used in various fields such as network analysis, social network analysis, data visualization, and communication network optimization.
Problems Solved
- Efficient construction and display of bipartite graphs.
- Simplification of complex computational graphs.
- Improved visualization of communication paths.
Benefits
- Enhanced understanding of communication networks.
- Streamlined data analysis processes.
- Improved decision-making based on network structures.
Commercial Applications
- Network analysis software tools.
- Data visualization platforms.
- Communication network optimization services.
Prior Art
Readers can explore prior research on bipartite graph construction methods and display techniques in the field of network analysis and data visualization.
Frequently Updated Research
Stay updated on the latest advancements in bipartite graph construction methods and applications in network analysis and data visualization.
Questions about Bipartite Graph Construction and Display
1. How does the aggregation operation in the construction method contribute to simplifying the bipartite graph? 2. What are the potential real-world applications of bipartite graphs in communication network optimization?
Original Abstract Submitted
This application discloses a construction method and apparatus for a bipartite graph, and a display method and apparatus for a bipartite graph. The construction method includes: searching a computational graph for at least one cross-communication edge corresponding to a first communication node, where the first communication node is one of M communication nodes included in the computational graph, the first communication node corresponds to P predecessor nodes and Q successor nodes, each of the at least one cross-communication edge indicates a communication path between one of the P predecessor nodes and one of the Q successor nodes, and no cross-communication edge passes through the M communication nodes; and cutting cross-communication edges respectively corresponding to the M communication nodes, and performing an aggregation operation to obtain the bipartite graph, where any two of the M communication nodes are connected without an edge in the bipartite graph.
