tree - PerfectmatchingWe study bottleneck labeled optimization problems arising in the context of graph theory. This long-established model partitions the set of edges into classes, each of which is identified by a unique color. The generic objective is to construct a subgraph of prescribed ...
Graph Theory 17(2), 259–269 (1997) CrossRef T. Brüggemann, J. Monnot, G.J. Woeginger, Local search for the minimum label spanning tree problem with bounded color classes. Oper. Res. Lett. 31, 195–201 (2003) CrossRef M. Captivo, J.C. Climaco, M.M. Pascoal, A ...
Let T be any spanning tree of a graph G=(V,E). Choose an arbitrary leaf vi of T, and let vj be the vertex in V such that f0(vj)=i. Then, we move the token i from the current position vj to its target position vi. Let (w1,w2,…,wq) be a unique path in T from w1=vj...
Algorithm of Multi-valued Attribute and Multi-labeled Data Decision Tree This paper develops a decision tree classifier SSC(similarity of same and consistent) for multi-valued and multi-labeled data,improves on MMC's formula for... R Zhao,LI Hong - 《Computer Engineering》 被引量: 11发表: 20...
Combining labeled and unlabeled data with co-training:(与co-training结合标记和未标记数据).pdf,Combining Lab eled and Unlab eled Data with CoTraining y Avrim Blum Tom Mitchell School of Computer Science School of Computer Science Carnegie Mellon Univer
WLOG presentations, where the underlying graph is a tree, are of central importance in view of Whitehead's Asphericity Conjecture. We present a class of aspherical word labeled oriented graphs. This class can be used to produce highly non-injective aspherical labeled oriented trees and also ...
Theoretical or Mathematical/ graph theorymolecular configurationstrees (mathematics)/ spanning treeslabeled planar molecular graphinner dualreduction formulaquantum mechanicsC atom connectivityplanar conjugated systemcatacondensed benzenoid moleculesThe quantum mechanical relevance of the concept of a spanning tree ...
On Graph Powers for Leaf-labeled Trees - Nishimura, Ragde, et al. - 2002 () Citation Context ...t graph [4]. In particular, determining if a graph has a tree square root can be done in O(n + e) time [8], where e is the number of edges in the input graph. Recently, ...
Using a more exact result, a basic theorem is derived for the application of the theory of branching ("cascade") processes in chemistry. The basic theorem lays down restrictions imposed on cascade processes if every vertex of a cascade-tree is to be equally likely to turn up as root....
Automata theoryTree automatonGraph automatonNP-completenessChemoinformaticsThis paper introduces spanning tree automata (ST automata) usable for defining sets of labeled, connected graphs. The automata are simply obtained by extending ordinary top-down finite tree automata for labeled, ordered trees. It is...