Results 41 to 50 of about 184,015 (290)
Random partitions in statistical mechanics [PDF]
, 2014 We consider a family of distributions on spatial random partitions that provide a coupling between different models of interest: the ideal Bose gas; the zero-range process; particle clustering; and spatial permutations.
Nicholas Ercolani (16242443) +8 more
core +1 more source
Acyclic, Star and Oriented Colourings of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let G be a graph with chromatic number χ(G). A vertex colouring of G is acyclic if each bichromatic subgraph is a forest. A star colouring of G is an acyclic colouring in which each bichromatic subgraph is a star forest. Let χ a (G) and χ s (G)
David R. Wood
doaj +2 more sources
Partitions of networks that are robust to vertex permutation dynamics
Special Matrices, 2015 Minimum disconnecting cuts of connected graphs provide fundamental information about the connectivity structure of the graph. Spectral methods are well-known as stable and efficient means of finding good solutions to the balanced minimum cut problem.
Froyland Gary, Kwok Eric
doaj +1 more source
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
Parameterized streaming : maximal matching and vertex cover [PDF]
, 2014 As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one.
Chitnis, Rajesh; id_orcid +11 more
core +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
Perfect 2-colorings of the cubic graphs of order less than or equal to 10
AKCE International Journal of Graphs and Combinatorics, 2020 Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect -coloring of a graph with colors is a partition of the vertex set of into m parts , . . .
Mehdi Alaeiyan, Ayoob Mehrabani
doaj +1 more source
Vertex partition of hypergraphs and maximum degenerate subhypergraphs [PDF]
Electronic Journal of Graph Theory and Applications, 2021 12 ...
Thomas Schweser, Michael Stiebitz
openaire +5 more sources
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
Partition dimension of trees - palm approach
Electronic Journal of Graph Theory and ApplicationsThe partition dimension of a graph is the minimum number of vertex partitions such that every vertex has different distances to the ordered partitions. Many resolving partitions for trees have all vertices not in an end-path in the same partition.
Yusuf Hafidh, Edy Tri Baskoro
doaj +1 more source