Results 1 to 10 of about 704,956 (316)
Fuzzing Test Case Generation Method Based on Depth-first Search [PDF]
Jisuanji kexue, 2021 Fuzzing test is an important method to exploit network protocol vulnerability.Existing fuzzing test methods have some problems such as incomplete path coverage and low efficiency.To solve these problems,this paper proposes a depth-first search based ...
LI Yi-hao, HONG Zheng, LIN Pei-hong
doaj +1 more source
The equivariant topology of stable Kneser graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Schrijver introduced the stable Kneser graph $SG_{n,k}, n \geq 1, k \geq 0$. This graph is a vertex critical graph with chromatic number $k+2$, its vertices are certain subsets of a set of cardinality $m=2n+k$.
Carsten Schultz
doaj +1 more source
Testing graph isomorphism [PDF]
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06, 2006 Two graphs $G$ and $H$ on $n$ vertices are $\epsilon$-far from being isomorphic if at least $\epsilon\binom{n}{2}$ edges must be added or removed from $E(G)$ in order to make $G$ and $H$ isomorphic. In this paper we deal with the question of how many queries are required to distinguish between the case that two graphs are isomorphic and the case that ...
Eldar Fischer, Arie Matsliah
openaire +2 more sources
IEEE Access, 2022 Cause-effect graphs are a popular black-box testing technique. The most commonly used approach for generating test cases from cause-effect graph specifications uses backward-propagation of forced effect activations through the graph in order to get the ...
Ehlimana Krupalija +5 more
doaj +1 more source
Convolutional Neural Network Outperforms Graph Neural Network on the Spatially Variant Graph Data
Mathematics, 2023 Applying machine learning algorithms to graph-structured data has garnered significant attention in recent years due to the prevalence of inherent graph structures in real-life datasets.
Anna Boronina +2 more
doaj +1 more source
Graph-constrained group testing [PDF]
2010 IEEE International Symposium on Information Theory, 2010 Full version to appear in IEEE Transactions on Information Theory. A preliminary summary of this work appeared (under the same title) in proceedings of the 2010 IEEE International Symposium on Information ...
Mahdi Cheraghchi +3 more
openaire +3 more sources
New heuristics for burning connected graphs [PDF]
AUT Journal of Mathematics and Computing, 2022 The concept of graph burning and burning number (bn(G)) of a graph G was introduced recently [4]. Graph burning models the spread of contagion (fire) in a graph in discrete time steps. bn(G) is the minimum time needed to burn a graph G. The problem is NP-
Maryam Tahmasbi +3 more
doaj +1 more source
Testing for directed information graphs [PDF]
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2017 In this paper, we study a hypothesis test to determine the underlying directed graph structure of nodes in a network, where the nodes represent random processes and the direction of the links indicate a causal relationship between said processes. Specifically, a k-th order Markov structure is considered for them, and the chosen metric to determine a ...
Sina Molavipour +2 more
openaire +3 more sources
INCATools/relation-graph: Release 2.3.2 [PDF]
, 2023 <h2>What's Changed</h2> <ul> <li>Cleanup. by @balhoff in https://github.com/INCATools/relation-graph/pull/171</li> <li>Update zio, zio-streams, zio-test, ...
Bill Duncan, Scala Steward, Jim Balhoff
core +1 more source
فاعلية وحدة مقترحة فى نظرية الجراف وتطبيقاتها فى تنمية تحصيل أساسيات نظرية الجراف والتفکير البصري لدى تلاميذ المرحلة الإعدادية [PDF]
مجلة تربويات الرياضيات, 2017 هدف البحث الحالى إلى دراسة فاعلية وحدة فى نظرية الجراف وتطبيقاتها فى تنمية تحصيل أساسيات نظرية الجراف والتفکير البصري لدى تلاميذ المرحلة الإعدادية، وفى إطار تحقيق ذلک قام الباحث ببناء أدوات البحث والتي تمثلت فى الاختبار التحصيلى في نظرية الجراف، واختبار ...
يحيى زکريا صاوي
doaj +1 more source