|
|
|
|
|
Ravi Goyal and Victor De Gruttola
This paper presents a general recursive formula to estimate the number of labeled graphs as well as details to evaluate the formula for the following graph properties: number of edges (graph density), degree sequence, degree distribution, classification ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Amir Barghi and Daryl DeFord
The Stirling numbers for graphs provide a combinatorial interpretation of the number of cycle covers in a given graph. The problem of generating all cycle covers or enumerating these quantities on general graphs is computationally intractable, but recent...
ver más
|
|
|
|
|
|
|
|
|
|
|
Eric Dolores-Cuenca, José Antonio Arciniega-Nevárez, Anh Nguyen, Amanda Yitong Zou, Luke Van Popering, Nathan Crock, Gordon Erlebacher and Jose L. Mendoza-Cortes
In this paper, we study the flow of signals through linear paths with the nonlinear condition that a node emits a signal when it receives external stimuli or when two incoming signals from other nodes arrive coincidentally with a combined amplitude above...
ver más
|
|
|
|
|
|
|
|
|
|
|
Max Bannach and Sebastian Berndt
Research on the similarity of a graph to being a tree?called the treewidth of the graph?has seen an enormous rise within the last decade, but a practically fast algorithm for this task has been discovered only recently by Tamaki (ESA 2017). It is based o...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shyr-Long Jeng, Rohit Roy and Wei-Hua Chieng
Mason?s gain formula can grow factorially because of growth in the enumeration of paths in a directed graph. Each of the (n - 2)! permutation of the intermediate vertices includes a path between input and output nodes. This paper presents a novel method ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Charles A. Phillips, Kai Wang, Erich J. Baker, Jason A. Bubier, Elissa J. Chesler and Michael A. Langston
Let k denote an integer greater than 2, let G denote a k-partite graph, and let S denote the set of all maximal k-partite cliques in G. Several open questions concerning the computation of S are resolved. A straightforward and highly-scalable modificatio...
ver más
|
|
|
|
|
|
|
|
|
|
|
Vladimir Beskorovainyi, Olexij Kuropatenko, Denys Gobov
Pág. 24 - 32
The subject of research in the article is the network of closed logistics. The goal of the work is the creation of mathematical models and methods for solving problems of optimizing transportation routes in closed-loop logistics systems, taking into acco...
ver más
|
|
|
|
|
|