Enumeration of Spanning Trees Using Edge Exchange with Minimal Partitioning
نویسنده
چکیده
................................................................................................................... 1 Abstract in Arabic ...................................................................................................... 2in Arabic ...................................................................................................... 2 Chapter
منابع مشابه
Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective
For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components. A vertex separator S is minimal if it contains no other separator as a strict subset and a minimum vertex separator is a minimal vertex separator of least cardinality. A clique is a set of mutually adjacent vertices. A 2-tree is a connected graph in which every maximal clique is of size...
متن کاملEnumeration of spanning trees of certain graphs
In this note we give an algorithm which enables us to encode and enumerate all the spanning trees of a multipartite graph (see below). This algorithm may turn out to be useful for the enumeration of spanning trees satisfying certain conditions. The number of spanning trees of a given graph Γ without loops and without multiple edges will be denoted by_i(T). We shall consider the graphs Γ = T(G; ...
متن کاملSpanning Trees in 2-trees
A spanning tree of a graph G is a connected acyclic spanning subgraph of G. We consider enumeration of spanning trees when G is a 2-tree, meaning that G is obtained from one edge by iteratively adding a vertex whose neighborhood consists of two adjacent vertices. We use this construction order both to inductively list the spanning trees without repetition and to give bounds on the number of the...
متن کاملMinimal Edge-ordered Spanning Trees Using a Self-adapting Genetic Algorithm with Multiple Genomic Representations
We consider the problem of finding minimal edge-ordered spanning trees where the edge costs are not fixed, but are time dependent[7]. We propose using multiple genomic redundant representations in a selfadapting genetic algorithm (GA) employing various codes with different locality properties. These encoding schemes (e.g., permutation codes and prufer-like codes) either insure feasibility or re...
متن کاملMissing The Forest to Count the Trees: Spanning Tree Enumeration in Complete and Non-Complete Graphs
Spanning trees have been studied extensively and have many practical applications. From astronomers using spanning trees to find quasar superstructures, to biomedical engineers detecting actin fibers in cell images tree enumeration remains an interesting problem. In this paper we examine a simple, practical, algebraic approach for the enumeration of spanning trees in complete and non-complete g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1407.0699 شماره
صفحات -
تاریخ انتشار 2014