View source for 18666930. CONSTRUCTION METHOD AND APPARATUS FOR BIPARTITE GRAPH, AND DISPLAY METHOD AND APPARATUS FOR BIPARTITE GRAPH simplified abstract (HUAWEI TECHNOLOGIES CO., LTD.)

=CONSTRUCTION METHOD AND APPARATUS FOR BIPARTITE GRAPH, AND DISPLAY METHOD AND APPARATUS FOR BIPARTITE GRAPH=


==Organization Name==

[[:Category:HUAWEI TECHNOLOGIES CO., LTD.|HUAWEI TECHNOLOGIES CO., LTD.]]


[[Category:HUAWEI TECHNOLOGIES CO., LTD.]]

==Inventor(s)==

[[:Category:Zhongwei Wang of Hangzhou (CN)|Zhongwei Wang of Hangzhou (CN)]][[Category:Zhongwei Wang of Hangzhou (CN)]]

[[:Category:Rongchen Zhu of Hangzhou (CN)|Rongchen Zhu of Hangzhou (CN)]][[Category:Rongchen Zhu of Hangzhou (CN)]]

[[:Category:Han Gao of Hong Kong (CN)|Han Gao of Hong Kong (CN)]][[Category:Han Gao of Hong Kong (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.



[[Category:G06N3/0464]]
[[Category:G06N3/0455]]
[[Category:G06N3/08]]
[[Category:G06T1/20]]
[[Category:CPC_G06N3/0464]]