Results 21 to 30 of about 52,307 (305)
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements [PDF]
, 2014 We consider degree bounded network design problems with element and vertex connectivity requirements. In the degree bounded Survivable Network Design (SNDP) problem, the input is an undirected graph G = (V, E) with weights w(e) on the edges and degree ...
Ali Vakilian +3 more
core +1 more source
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
Graph Realizations: Maximum Degree in Vertex Neighborhoods [PDF]
, 2020 The classical problem of degree sequence realizability asks whether or not a given sequence of n positive integers is equal to the degree sequence of some n-vertex undirected simple graph. While the realizability problem of degree sequences has been well
Rawitz, Dror +3 more
core +1 more source
Estimation of vertex degrees in a sampled network [PDF]
2017 51st Asilomar Conference on Signals, Systems, and Computers, 2017 The need to produce accurate estimates of vertex degree in a large network, based on observation of a subnetwork, arises in a number of practical settings. We study a formalized version of this problem, wherein the goal is, given a randomly sampled subnetwork from a large parent network, to estimate the actual degree of the sampled nodes.
Apratim Ganguly, Eric D. Kolaczyk
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
Vertex-centric communities on degree-1 vertices. [PDF]
, 2017 We do not calculate extended vertex-centric communities for seed vertices of degree equal to 1. However, they may be included in extended communities centered on other vertices.
Yiannis Kompatsiaris (3826402) +2 more
core +1 more source
Degree sum condition for vertex-disjoint 5-cycles [PDF]
Discussiones Mathematicae Graph TheoryLet $n$ and $k$ be two integers and $G$ a graph with $n=5k$ vertices. Wang proved that if $\delta(G)\geq 3k$, then $G$ contains $k$ vertex disjoint cycles of length $5$.
Maoqun Wang, Jianguo Qian
doaj +2 more sources
On Certain Types of Neutrosophic Fuzzy Graphs
Pan-American Journal of Mathematics, 2022 In this paper, we introduce some types of NF graphs and operations. Also we define the partial NF subgraph, spanning NF subgraph, strong degree of the vertex, total strong degree of the vertex and its properties are included.
Alias B. Khalaf, Prithivirajan Padma
doaj +1 more source
Usefulness of Combinations of Vertex-Degree Weighted Path Indices and Elements of a Universal Matrix
Acta Chimica Slovenica, 2019 The mutually optimized combinations of vertex-degree weighted path indices and the vertex-degree vertex-distance weighted elements of the Universal matrix were applied in the way of TInew = ∑kN×PN(aN,bN,...) + kij×uij(aij,bij,cij).
Anton Perdih
doaj +1 more source
Complexity of approximating bounded variants of optimization problems [PDF]
, 2006 We study low degree graph problems such as Maximum Independent Set and Minimum Vertex Cover. The goal is to improve approximation lower bounds for them and for a number of related problems like Max-B-Set Packing, Min-B-Set Cover, and Max-B-Dimensional ...
Chlebikova, Janka +3 more
core +1 more source