Elementary school students will chart the free-throw attempts of every player and formulate graphs for their math classes.
Akutsu and Fukagawa [22] formulated the graph preimage problem as the problem of inferring graphs from the frequency of paths of labeled vertices and proved that the problem is computationally intractable (NP-hard) even for planar graphs with bounded degrees [22].
This grouping problem can be formulated as graph coloring problem (GCP), where the STAs in are vertices and two STAs, and in, are connected only when or.
For our formulated coalition graph game model, let x −n =(x 1,…,x n−1,x n+1,…,x N ) be the set of strategies chosen by other D2D users or relays except player n.
This problem can be formulated in graph-theoretic terms [ 40].
This idea can be easily formulated using graph-based semi-supervised learning [ 34].
For the related problem of viral quasispecies estimation, Eriksson et al. and Zagondi et al. previously formulated a graph-theoretic solution called ShoRAH [ 4, 5], which was applied to high diversity, high coverage data (e.g., HIV data representing 6.8% pairwise genetic divergence sequenced to 2100X [ 5]).
We formulate a graph query problem for miRNA and disease association discovery.
The problem of recognizing the largest MESP is formulated using permutation graph, and a simple O(n3) time algorithm is proposed.
We will use the model described in [5] where the channel (i.e., frequency band) allocation problem is formulated as a graph coloring problem.
With the above conceptual definitions of E 1 z) and E 2 z), the optimization of (8) is actually formulated as a graph matching problem [10, 11, 35].
