Results 21 to 30 of about 3,864 (298)
Coherent network partitions [PDF]
, 2021 We continue to study coherent partitions of graphs whereby the vertex set is partitioned into subsets that induce biclique spanned subgraphs. The problem of identifying the minimum number of edges to obtain biclique spanned connected components (CNP ...
Omranian, Sara (Dr.) +2 more
core +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
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
NP-completeness of the Planar Separator Problems
Journal of Graph Algorithms and Applications, 2006 For a given graph G, the Separator Problem asks whether a vertex or edge set of small cardinality (or weight) exists whose removal partitions G into two disjoint graphs of approximately equal sizes.
Junichiro Fukuyama
doaj +1 more source
On the Packing Partitioning Problem on Directed Graphs
Mathematics, 2021 This work is aimed to continue studying the packing sets of digraphs via the perspective of partitioning the vertex set of a digraph into packing sets (which can be interpreted as a type of vertex coloring of digraphs) and focused on finding the minimum ...
Babak Samadi, Ismael G. Yero
doaj +1 more source
On vertex partitions and some minor-monotone graph parameters [PDF]
, 2010 International audienceWe study vertex partitions of graphs according to some minor-monotone graph parameters. Ding et al. [J Combin Theory Ser B 79(2) (2000), 221-246] proved that some minor-monotone parameters ρ are such that, any graph G with ρ(G)⩾2 ...
Gonçalves, Daniel, D. Gonçalves
core +1 more source
Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield ...
Teresa W. Haynes, Michael A. Henning
doaj +1 more source
Complexity of conditional colouring with given template [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Peter J. Dukes +2 more
doaj +1 more source
Vertex Separators for Partitioning a Graph [PDF]
Sensors, 2008 Finite Element Method (FEM) is a well known technique extensively studiedfor spatial and temporal modeling of environmental processes, weather predictioncomputations, and intelligent signal processing for wireless sensors. The need for hugecomputational power arising in such applications to simulate physical phenomenoncorrectly mandates the use of ...
openaire +3 more sources
Augmenting graphs to partition their vertices into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. There exist infinite families of graphs that are not TI-graphs. We define the TI-augmentation number \(\operatorname{ti}(
Teresa W. Haynes, Michael A. Henning
doaj +1 more source