The path-partition problem is to find the path-partition number p(G) of a graph G, which is the minimum cardinality of a path partition of G. Obviously G has a Hamiltonian path if and only if [2]p(G)= 1. Since the Hamiltonian path problem is NP complete forplanar graphs, bipartite...
Stream Now Shows Shows See All Shows Gold Rush Naked and Afraid Expedition Unknown Deadliest Catch Moonshiners Harpoon Hunters Homestead Rescue See All Shows Schedule
Note that in real applications, butterfly counting may happen not only once in a graph. We may need to conduct such a computation against an arbitrarily specified subgraph. Indeed, there can exist a high demand for butterfly counting in large networks. However, the existing solutions cannot eff...
To model the environment, targets, and obstacles are modeled as geometrical shapes and stored in a data structure, e.g., a graph, whose nodes and edges are represented by points and lines10. Energy consumption UAVs have limited energy storage. The stored energy might be just enough to fly ...
A Brandst?Dt,R Mosca - 《Electronic Notes in Discrete Mathematics》 被引量: 2发表: 2017年 Triple Domination Number of a Butterfly Graph Domination Theory is an important branch of Graph Theory that has wide range of applications to various branches of Science and Technology. A new family of...
Metabolome-scale de novo pathway reconstruction using regioisomer-sensitive graph alignments. Bioinformatics. 31, i161–i170 (2015). CAS PubMed PubMed Central Google Scholar Yamanishi, Y., Hattori, M., Kotera, M., Goto, S. & Kanehisa, M. E-zyme: predicting potential EC numbers from the ...
The connectivity analysis was performed in ArcMap and in the program Conefor 2.6 (Saura and Torné2012). In Conefor, the recommended probabilistic index called probability of connectivity (PC) was used. PC is a graph-based habitat availability metric that quantifies functional connectivity (Saura ...
Male-specific epicuticular compounds of the sulfur butterfly Colias erate poliographus (Lepidoptera: Pieridae) Appl. Entomol. Zool., 50 (2015), pp. 191-199 CrossrefView in ScopusGoogle Scholar 43 H. Ômura, T. Itoh, D.M. Wright, H. Pavulaan, S. Schröder Morphological study of alar...
In:... LiD. et al. Privacy-preserving large-scale systems of linear equations in outsourcing storage and computation Sci China Inf Sci (2018) There are more references available in the full text version of this article. Cited by (6) A graph signal processing approach to Fourier-like number...
The super restricted edge-connectivity of a graph is an important parameter to measure fault-tolerance ofinterconnection networks. 图的超级限制边连通性是度量计算机互连网络可靠性(容错性)的一个重要参数。 2. By means of the theory of isomorphic graph, the proposed algorithm is extended to some other...