Results 31 to 40 of about 295,471 (297)
Tree partitioning via vertex deletion
Electronic Notes in Discrete Mathematics, 2001 Abstract Motivated by tree partitioning problems, we introduce the notion of i-divider of a tree, t -dividers generalize concepts well-known in literature, such as centroids and separators, that are the backbone of tree decomposition algorithms based on vertex deletion.
FINOCCHI, Irene, PETRESCHI, Rossella
openaire +3 more sources
Instanton counting and O-vertex
Journal of High Energy Physics, 2021 We present closed-form expressions of unrefined instanton partition functions for gauge groups of type BCD as sums over Young diagrams. For SO(n) gauge groups, we provide a fivebrane web picture of our formula based on the vertex-operator formalism of ...
Satoshi Nawata, Rui-Dong Zhu
doaj +1 more source
Vertex Set Partitions Preserving Conservativeness
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander A. Ageev +1 more
openaire +1 more source
On the Locating Chromatic Number of Certain Barbell Graphs
International Journal of Mathematics and Mathematical Sciences, 2018 The locating chromatic number of a graph G is defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are not ...
Asmiati +2 more
doaj +1 more source
Which metrics for vertex-cut partitioning? [PDF]
2016 11th International Conference for Internet Technology and Secured Transactions (ICITST), 2016 In this paper we focus on vertex-cut graph partitioning and we investigate how it is possible to evaluate the quality of a partition before running the computation. To this purpose we scrutinize a set of metrics proposed in literature. We carry experiments with the widely-used framework for graph processing Apache GraphX and we perform an accurate ...
Mykhailenko, Hlib +2 more
openaire +2 more sources
Minimum 2SAT-DELETION: inapproximability results and relations to Minimum Vertex Cover [PDF]
, 2007 The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al.
Chlebikova, Janka +5 more
core +1 more source
Frugality Ratios and Improved Truthful Mechanisms for Vertex Cover [PDF]
, 2007 In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay as little as possible.
Elkind, Edith +2 more
core +2 more sources
Partitioning 3-colored complete graphs into three monochromatic cycles [PDF]
, 2011 We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at
Gyárfás, András +3 more
core +1 more source
THE PARTITION DIMENSION OF CYCLE BOOKS GRAPH B_(m,n) WITH A COMMON PATH P_2
BarekengSuppose is a connected graph with elements of a set of vertices denoted by and a subset of . The distance between and is the shortest distance to every vertex in . Let be a partition of , where each subset belongs to .
Jaya Santoso, Darmaji Darmaji
doaj +1 more source
The Partition Dimension of Daisy Graphs and Its Barbell
Science and Technology IndonesiaThe partition dimension of a graph is determined by minimum number of vertex partitions such that every vertex has different distances to the ordered partitions.
Asmiati +3 more
doaj +1 more source