
- [1] . 2020. Edge AI - convergence of edge computing and artificial intelligence. Springer. https://www.springer.com/gp/book/9789811561856.Google Scholar
- [2] . 2019. Smart-Edge-CoCaCo: AI-enabled smart edge with joint computation, caching, and communication in heterogeneous IoT. IEEE Network 33, 2 (2019), 58–64.Google Scholar
Cross Ref
- [3] . 2020. Convergence of edge computing and deep learning: A comprehensive survey. IEEE Communications Surveys & Tutorials 22, 2 (2020), 869–904.Google Scholar
Cross Ref
- [4] . 2018. Edge-CoCaCo: Toward joint optimization of computation, caching, and communication on edge cloud. IEEE Wireless Communications 25, 3 (2018), 21–27.Google Scholar
Cross Ref
Recommendations
On 3-Edge-Connected Supereulerian Graphs
The supereulerian graph problem, raised by Boesch et al. (J Graph Theory 1:79–84, 1977), asks when a graph has a spanning eulerian subgraph. Pulleyblank showed that such a decision problem, even when restricted to planar graphs, is NP-complete. Jaeger ...
Collapsible subgraphs of a 4-edge-connected graph
AbstractJaeger in 1979 showed that every 4-edge-connected graph is supereulerian, graphs that have spanning eulerian subgraphs. Catlin in 1988 sharpened Jaeger’s result by showing that every 4-edge-connected graph is collapsible, graphs that ...
Maximally edge-connected hypergraphs
The edge-connectivity of a connected graph or hypergraph is the minimum number of edges whose removal renders the graph or hypergraph, respectively, disconnected. The edge-connectivity of a (hyper) graph cannot exceed its minimum degree. For graphs, ...






Comments