The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The connected component of an undirected graph plays an important part in graph theory. It is straightforward to compute the connected components of a graph in linear time using either breadth-first search or depth-first search. However when confronted with large scale data, both of the two algorithms are hard to execute. In this paper, we introduce a recently proposed community detection technique...
Structure mining plays an important part in the researches in biology, physics, Internet and telecommunications in recently emerging network science. As a main task in this area, the problem of structure mining on graph has attracted much interest and been studied in variant avenues in prior works. However, most of these works mainly rely on single chip computational capacity and have been constrained...
Structure mining plays an important part in the researches in biology, physics, Internet or telecommunications in recently emerging network science. As a main task in this area, the problem of maximal clique enumeration has attracted much interest and been studied in variant avenues in prior works. However, most of these works mainly rely on single chip computational capacity and have been constrained...
Graph theory is the theoretical fundamental of network technologies. This paper reports an investigation of stability issues of the network technologies based on the graph theory. It also presents solutions of the geodetic number of graph Cm times Cn. There are many parameters which can measure to some extent the robustness of an interconnection network with respect to link failures, such as domination...
The structure of customer communication network provides us the insights into the function of customers' relationships. In this paper, we use egocentric social network to explore how people manage their personal and group communications over time. Our primary goal is that our findings can provide business insights and help devise strategies for telecom service providers. We are interested in tracking...
Detecting the community of complex networks became the hot research fields of Graph Ming in recent years and most community detecting methods current try to find correct community structure basing on optimization of Modularity Q. In this article, the author constructs a new theoretic model of Q based on information entropy by simulation and evaluation on some classic dataset and comparison with the...
Graph theory is the fundamental basis of the neural networks. This paper reports the investigation work of the relationships between artificial neural networks and graph theory, and presents the analysis of the specific issues relating to the change of the geodetic number due to operations on the graphs. Recent research work on the geodetic number of graphs has been found in the literature. Determining...
Service adaptation is one of the most important issues in SOC (Service Oriented Computing). This paper focuses on the issue of service behavioral adaptation and proposes an adapting method based on dependency graph. It can be divided into three sequential sub-problems: (1) service description-the foundation of service adaptation. We propose a formal approach to describing service behavior protocols;...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.