Results 31 to 40 of about 184,015 (290)
Crown reductions for the Minimum Weighted Vertex Cover problem [PDF]
, 2004 The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International ...
Chlebikova, Janka +6 more
core +1 more source
Vertex sparsifiers : new results from old techniques [PDF]
, 2014 Given a capacitated graph $G = (V,E)$ and a set of terminals $K \subseteq V$, how should we produce a graph $H$ only on the terminals $K$ so that every (multicommodity) flow between the terminals in $G$ could be supported in $H$ with low congestion, and ...
Gupta, Anupam +10 more
core +1 more source
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
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
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
Complexity of conditional colouring with given template [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Peter J. Dukes +2 more
doaj +1 more source
, 2011 A graph that has a Smarandachely vertex-mean k-labeling is called Smarandachely k vertex-mean graph or Smarandachely k V -mean graph. Particularly, if k = 0, such a Smarandachely vertex-mean 0-labeling and Smarandachely 0 vertex-mean graph or ...
Lourdusamy, A., Seenivasan, M.
core +1 more source
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
TWO CONJECTURES CONCERNING EXTENTS OF SMARANDACHE FACTOR PARTITIONS [PDF]
, 2001 In this paper we verify two conjectures concerning extents of Smarandache factor ...
Maohua, Le
core +1 more source