Results 21 to 30 of about 184,015 (290)
The SLD vertex detector upgrade (VXD3) and a study of bbg events [PDF]
, 1998 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This thesis presents a variety of work concerning the design, construction and use of the SLD's vertex detector.
Dervan, Paul John
core +7 more sources
$k$-Efficient partitions of graphs [PDF]
Communications in Combinatorics and Optimization, 2019 A set $S = \{u_1,u_2, \ldots, u_t\}$ of vertices of $G$ is an efficient dominating set if every vertex of $G$ is dominated exactly once by the vertices of $S$.
M. Chellali +2 more
doaj +1 more source
Distance Domination in Vertex Partitioned Graphs
Mathematica Pannonica, 2022 We treat a variation of graph domination which involves a partition (V 1, V 2,..., Vk) of the vertex set of a graph G and domination of each partition class V i over distance d where all vertices and edges of G may be used in the domination process. Strict upper bounds and extremal graphs are presented; the results are collected in three handy tables ...
Frendrup, Allan +2 more
openaire +2 more sources
On the Bounded Partition Dimension of Some Generalised Graph Structures
Journal of Mathematics, 2022 Consider λ to be a connected graph with a vertex set Vλ that may be partitioned into any partition set S. If each vertex in λ has a separate representation with regard to S and is an ordered k partition, then the set with S is a resolving partition of λ..
Wajdi Alghamdi, Muhammad Ahsan Asim
doaj +1 more source
Vertex Graceful Labeling-Some Path Related Graphs [PDF]
, 2013 Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P. +2 more
core +1 more source
AKCE International Journal of Graphs and Combinatorics, 2016 Let G be a graph with chromatic number χ(G) and consider a partition P of G into connected subgraphs. P is a puzzle on G if there is a unique vertex coloring of G using 1, 2, …, χ(G) such that the sums of the numbers assigned to the partition pieces are ...
Daphne Gold +10 more
doaj +1 more source
Vertex and edge covers with clustering properties: complexity and algorithms [PDF]
, 2009 We consider the concepts of a t-total vertex cover and a t-total edge cover (t≥1), which generalise the notions of a vertex cover and an edge cover, respectively.
Fernau, Henning +3 more
core +1 more source
Branch and bound with simplicial partitions for global optimization
Mathematical Modelling and Analysis, 2008 Branch and bound methods for global optimization are considered in this paper. Advantages and disadvantages of simplicial partitions for branch and bound are shown.
Julius Žilinskas
doaj +1 more source
Accelerate Incremental TSP Algorithms on Time Evolving Graphs with Partitioning Methods
Algorithms, 2022 In time-evolving graphs, the graph changes at each time interval, and the previously computed results become invalid. We addressed this issue for the traveling salesman problem (TSP) in our previous work and proposed an incremental algorithm where the ...
Shalini Sharma, Jerry Chou
doaj +1 more source
Distributed Vertex-Cut Partitioning [PDF]
, 2014 Graph processing has become an integral part of big data analytics. With the ever increasing size of the graphs, one needs to partition them into smaller clusters, which can be managed and processed more easily on multiple machines in a distributed fashion. While there exist numerous solutions for edge-cut partitioning of graphs, very little effort has
Fatemeh Rahimian +3 more
openaire +2 more sources