Titlebook: New Trends in Computer Technologies and Applications; 25th International C Sun-Yuan Hsieh,Ling-Ju Hung,Sheng-Lung Peng Conference proceedin

Aviary

夹克怕包裹

Novel Ways of Enumerating Restrained Dominating Sets of Cyclesned domination number of ., denoted by ., is the smallest cardinality of a restrained dominating set of .. Finding the restrained domination number is NP-hard for bipartite and chordal graphs. Let . be the family of restrained dominating sets of a graph . of order . with cardinality ., and let .. Th

强行引入

Fault Diagnosability of Multigraph Matching Composition Networks same order. To construct multiprocessor systems, we generalize matching composition networks (MCNs) to multigraph matching composition networks (MMCNs), which are connected graphs obtained by adding a perfect matching . between connected graphs . with a same order, where .. In this paper, we propos

Meditate

TAP

Hamiltonian Properties of the Dragonfly Networkeffective cardinality of the network. The Hamiltonian property is instrumental in communication networks. In this paper, we study the Hamiltonian properties of the logical graph of the dragonfly network, denoted by .(., ., .), where ., ., and . represent the number of vertices in each group, the num

爱社交

Fine Grained Space Complexity and the Linear Space Hypothesis (Preliminary Report)lems under various complexity-theoretical hypotheses, including the strong exponential time hypothesis (SETH), the orthogonal vector problem (OVP), and the 3 sum problem (3SUM). Concerning space complexity limitations of tractable problems, as a natural analogy of SETH, the linear space hypothesis (

北极熊

Partition-Edge Fault-Tolerant Hamiltonicity of Pancake Graphsce of edge faults in large-scale networks and the wide application of path and cycle structures, it is essential and practical to explore the embedding of Hamiltonian paths and cycles in faulty networks. However, existing fault models ignore practical distributions of faulty edges so that only linea

ERUPT

Aphorism

Antecedent

Dong Xianghe areas of complexity theory and foundations of cryptography: 20 research contributions, 13 survey articles, and 3 programmatic and reflective viewpoint statements. These so far formally unpublished pieces were written by Oded Goldreich, some in collaboration with other scientists. .The articles in