Results 51 to 60 of about 971 (113)
Open Mathematics, 2018 The problem of structures learning in Bayesian networks is to discover a directed acyclic graph that in some sense is the best representation of the given database. Score-based learning algorithm is one of the important structure learning methods used to
Wang Jingyun, Liu Sanyang
doaj +1 more source
Interval-Valued Fuzzy Soft Graphs
Topological Algebra and its Applications, 2017 In this paper, we combine concepts of interval-valued fuzzy soft sets and graph theory. Then we introduce notations of interval-valued fuzzy soft graphs and complete interval-valued fuzzy soft graphs.
Zihni Onur +2 more
doaj +1 more source
Annular and pants thrackles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a thrackle drawing of a graph on the plane cannot have more edges than vertices.
Grace Misereh, Yuri Nikolayevsky
doaj +1 more source
Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix [PDF]
Logical Methods in Computer Science, 2020 This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+Mix proof nets is equivalent to the problem of uniqueness of a perfect ...
Lê Thành Dũng Nguyên
doaj +1 more source
Evasive Properties of Sparse Graphs and Some Linear Equations in Primes
, 2013 We give an unconditional version of a conditional, on the Extended Riemann Hypothesis, result of L. Babai, A. Banerjee, R. Kulkarni and V. Naik (2010) on the evasiveness of sparse graphs.Comment: This version corrects a mistake made in the previous ...
Shparlinski, Igor
core +1 more source
On dynamic network security: A random decentering algorithm on graphs
Open Mathematics, 2018 Random Decentering Algorithm (RDA) on a undirected unweighted graph is defined and tested over several concrete scale-free networks. RDA introduces ancillary nodes to the given network following basic principles of minimal cost, density preservation ...
Trobajo M.T. +2 more
doaj +1 more source
Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 We study Markov chains for $\alpha$-orientations of plane graphs, these are orientations where the outdegree of each vertex is prescribed by the value of a given function $\alpha$.
Stefan Felsner, Daniel Heldt
doaj +1 more source
Lower and upper bounds of shortest paths in reachability graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 57, Page 3023-3036, 2004., 2004 We prove the following property for safe marked graphs, safe conflict‐free Petri nets, and live and safe extended free‐choice Petri nets. We prove the following three results. If the Petri net is a marked graph, then the length of the shortest path is at most (|T| − 1) · |T|/2.
P. K. Mishra
wiley +1 more source
Super edge-connectivity and matching preclusion of data center networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Edge-connectivity is a classic measure for reliability of a network in the presence of edge failures. $k$-restricted edge-connectivity is one of the refined indicators for fault tolerance of large networks.
Huazhong Lü, Tingzeng Wu
doaj +1 more source
On the smallest snarks with oddness 4 and connectivity 2 [PDF]
, 2018 A snark is a bridgeless cubic graph which is not 3-edge-colourable. The oddness of a bridgeless cubic graph is the minimum number of odd components in any 2-factor of the graph. Lukot'ka, M\'acajov\'a, Maz\'ak and \v{S}koviera showed in [Electron.
Goedgebeur, Jan
core +2 more sources