A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Prufer Coding: A Vectorization Method for Undirected Labeled Graph
2020
IEEE Access
Preserved Fulltext
Prufer coding and decoding flowcharts for undirected labeled graph The prufer coding and decoding flow for the undirected labeled graph is shown in Figure 10 . ...
In order to realize it, our contributions could be summarized as follows: a) Propose a method for undirected labeled graph vectorization based on the prufer algorithm, including graph encoding and decoding ...
Author Name: Preparation of Papers for IEEE Access (February 2017) VOLUME XX, 2017 Author Name: Preparation of Papers for IEEE Access (February 2017) VOLUME XX, 2017 ...
doi:10.1109/access.2020.3024974
fatcat:7s3q2wyhxzcbdiqgyykujozrtq
A Prufer-Sequence Based Representation of Large Graphs for Structural Encoding of Logic Networks
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Our representation is based on Prufer encoding for trees. ...
Moreover, our method is based on a novel technique, called 𝒢𝒯-enhancement whereby we first transform the graph such that it can be represented by a singular tree. ...
Clearly, for decoding the graph, this methods can not solely rely on the Prufer code. ...
arXiv:2209.01596v1
fatcat:fl5yzgu6pjcmnnuyvpwexfdinm
Edge sets: an effective evolutionary coding of spanning trees
2003
IEEE Transactions on Evolutionary Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We propose representing spanning trees in evolutionary algorithms for network design problems directly as sets of their edges, and we describe initialization, recombination, and mutation operators for ...
Comparisons of this algorithm to others that encode candidate spanning trees via the Blob Code, with network random keys, and as strings of weights indicate the superiority of the edge-set encoding, particularly ...
Acknowledgments The authors would like to thank the anonymous reviewers and David Fogel for their their valueable comments on a previous version of this article. ...
doi:10.1109/tevc.2002.807275
fatcat:iaecjournrdanmcuukhqbajx2i
Unified parallel encoding and decoding algorithms for Dandelion-like codes
2010
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Namely, a unique encoding algorithm and a unique decoding algorithm, which when properly parameterized, can be used for all Dandelion-like codes, are designed. ...
The Dandelion-like codes are eight bijections between labeled trees and strings of node labels. ...
A free tree is converted into a directed graph by replacing each undirected edge {u, v} by two directed edges (u, v) and (v, u) . ...
doi:10.1016/j.jpdc.2010.07.003
fatcat:tznv3kjkmfdpndfn6eoxtkmphq
Code representation learning with Prüfer sequences
2021
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
An effective and efficient code representation is critical to the success of sequence-to-sequence deep neural network models for a variety of tasks in code understanding, such as code summarization and ...
To test the efficacy of Prüfer-sequence-based representation, we designed a code summarization using a sequence-to-sequence learning model on real-world benchmark datasets. ...
Another approach in code representation learning is the tree-based or graph-based learning methods of the source code. ...
doi:10.14288/1.0402946
fatcat:hglo4wn6hrannnqqyprs2dm5wu
Recent Colorings And Labelings In Topological Coding
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The colorings and labelings of graph theory are main techniques in topological coding applied in asymmetric encryption system. ...
labelings and graph colorings. ...
We hope algebraic methods may solve some open problems of graph theory, for example, Graceful Tree Conjecture, and try to use algebraic methods for discovering possible regularity among labelings all in ...
arXiv:2106.15254v1
fatcat:xafgjp2bszbytkt6joeytqupu4
A preliminary comparison of tree encoding schemes for evolutionary algorithms
2007
2007 IEEE International Conference on Systems, Man and Cybernetics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
of solutions after those operations, and the corresponding heritability and locality; 2) The encoding methods have been employed in a genetic algorithm to solve three different instances (with 10, 25 ...
The results of this study provide insight into the properties of current encoding schemes for network design problems. ...
The decoding operators were labeled as follows: Label Decoding A Characteristic vector B Prüfer numbers C Network random keys D Edge sets E Node biased F Link and node biased The average decoding time ...
doi:10.1109/icsmc.2007.4414042
dblp:conf/smc/CarranoFTPN07
fatcat:lpjdrfpbvvdqlor2trcb3kt6si
Graph entropy rate minimization and the compressibility of undirected binary graphs
2012
2012 IEEE Statistical Signal Processing Workshop (SSP)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
With the increasing popularity of complex network analysis through the use of graphs, a method for computing graph entropy has become important for a better understanding of a network's structure and for ...
In this paper we propose a new approach for computing graph entropy with the intention of quantifying the compressibility of a graph. ...
Finally, other coding algorithms such as Huffman coding, Prüfer coding, or an original coding method will be implemented so as to achieve the compression indicated by our proposed entropy rate measure ...
doi:10.1109/ssp.2012.6319634
dblp:conf/ssp/BolanosAR12
fatcat:uhnriolkcrftzn3tq3cohfbhyq
Reliable Adaptive Data Aggregation Route Strategy for a Trade-off between Energy and Lifetime in WSNs
2014
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The data transmission path will be compromised for some disabled nodes. ...
In this paper, we address the reliable data aggregation route problem for WSNs. ...
The authors would like to thank Guolong Chen from Fuzhou University and Jie Li from University of Tsukuba for their invaluable expert advice that helped us successfully complete the paper. ...
doi:10.3390/s140916972
pmid:25215944
pmcid:PMC4208209
fatcat:go5dxncnbrgy5lvf4mifpzkk3m
A genetic algorithm for energy-efficient based multicast routing on MANETs
2008
Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These proposed methods have always considered several techniques such as a route load for relaying, battery lifetime in route selection, decreasing the frequency of sending control messages, optimizing ...
The simulation results show that our proposal method is an efficient and robust algorithm for multicast route selection. ...
Consider a wireless network modeled as an undirected graph G = (V, L), where V is a set of nodes and L is a set of links. ...
doi:10.1016/j.comcom.2007.10.033
fatcat:oa47cmim3jg57dxr6p23icxhqi
Statistics of delta peaks in the spectral density of large random trees
[article]
2003
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
The rest of the spectral density is a function which vanishes at all positions of peaks, which are a dense subset of real numbers: so this function is almost everywhere discontinuous. ...
Moreover all associated eigenvectors are strictly localized on a finite number of nodes. ...
Mallick for stimulating discussions and a careful reading of the manuscript. ...
arXiv:cond-mat/0301437v1
fatcat:ssmvw3fbcrcy3lch2ex3q2dwgu
How to encode a tree
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We construct bijections giving three "codes" for trees. These codes follow naturally from the Matrix Tree Theorem of Tutte and have many advantages over the one produced by Prufer in 1918. ...
In each case, we have at least two algorithms, one of which involves hands-on manipulations of the tree while the other involves a combinatorial and linear algebraic manipulation of a matrix. ...
The Prüfer Code In 1918, Prüfer [9] gave the following bijective proof of this formula. Given a labelled tree, we suppose that the least leaf is labelled i 1 , and that succ(i 1 ) = j 1 . ...
arXiv:1710.08463v1
fatcat:pkte265fcvebtlcs4ddnzvij7e
Diameter Constrained Fuzzy Minimum Spanning Tree Problem
2013
International Journal of Computational Intelligence Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Furthermore, a fuzzy simulation based hybrid genetic algorithm is designed to solve the proposed models using Prüfer like code representation of labeled trees. ...
Using the m λ measure, a generalization of credibility measure, the problem is formulated as chance-constrained programming problem and dependent-chance programming problem according to different decision ...
Acknowledgement The authors are grateful to an anonymous reviewer for pointing out some mistakes and for providing fruitful suggestions. ...
doi:10.1080/18756891.2013.816027
fatcat:e5uuqhmutrbj7aqbqo2nj2ldke
Universal Topological Regularities of Syntactic Structures: Decoupling Efficiency from Optimization
[article]
2023
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
This pattern can arise from a process optimizing for communicative efficiency or, alternatively, by construction, as a by-effect of a sublinear preferential attachment process reflecting language production ...
Human syntactic structures are usually represented as graphs. ...
Acknowledgments Code and data are available online [51] . The author is indebted to Prof. Marco Baroni for helpful suggestions on this manuscript. The author declares no competing interests. ...
arXiv:2302.00129v1
fatcat:7zqgi3yc2rbytfii6taetk3a6q
POSSIBILITY-BASED PROBABILITY MAXIMIZATION MODELS FOR FUZZY RANDOM MINIMUM SPANNING TREE PROBLEMS
2011
Scientiae mathematicae Japonicae
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
or equal to a satisficing level. ...
This paper deals with a minimum spanning tree programming problem involving fuzzy random weights. ...
One of the classical theorems in enumeration is Cayley's theorem [3] , which says that in a complete undirected graph with n vertices there are n n−2 distinct labeled trees. ...
doi:10.32219/isms.73.2_3_157
fatcat:eprtrvvrsfasfh7brcuj32zqwq
« Previous
Showing results 1 — 15 out of 52 results