An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences
An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences is a scholarly work, published in 2018 in ''Theory and Applications of Graphs''. The main subjects of the publication include data compression, correctness, biological sequence, integer data type, graphical model, combinatorics, computer science, automata theory, connected-component labeling, discrete mathematics, social connectedness, mathematics, degree, and algorithm. The authors present an algorithm to test whether a given graphical degree sequence is forcibly connected or not and prove its correctness.