X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
k-path vertex cover (15) 15
algorithms (12) 12
approximation algorithm (12) 12
mathematics, applied (12) 12
computer science (11) 11
p-3 problem (8) 8
graphs (7) 7
k-path (7) 7
mathematics (7) 7
[formula omitted]-path vertex cover (6) 6
bipartite graphs (6) 6
dissociation number (6) 6
ptas (6) 6
computer science, theory & methods (5) 5
vertex cover (5) 5
connected k-path vertex cover (4) 4
graph theory (4) 4
parameterized complexity (4) 4
polynomials (4) 4
analysis (3) 3
apexes (3) 3
complexity (3) 3
computer science, information systems (3) 3
independence number (3) 3
k-cycle (3) 3
mathematical analysis (3) 3
path vertex cover (3) 3
set (3) 3
unit disk graph (3) 3
algebra (2) 2
approximation (2) 2
colorful path (2) 2
combinatorics (2) 2
completeness (2) 2
computer science - data structures and algorithms (2) 2
computer science, software engineering (2) 2
connected k-subgraph cover (2) 2
cubic graphs (2) 2
cycles (2) 2
decision trees (2) 2
decycling number (2) 2
deletion (2) 2
domination (2) 2
graph (2) 2
hardness (2) 2
hitting set (2) 2
k-path connected vertex cover (2) 2
k-path partition (2) 2
kernelization (2) 2
optimization (2) 2
paths (2) 2
quasi-spider (2) 2
remote sensors (2) 2
terms (2) 2
theory of computation (2) 2
tree (2) 2
vertex k-path cover (2) 2
weight (2) 2
wireless sensor networks (2) 2
113 computer and information sciences (1) 1
3-path vertex cover (1) 1
519.17 [udc] (1) 1
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (1) 1
[ math.math-co ] mathematics [math]/combinatorics [math.co] (1) 1
[formula omitted]-path partition (1) 1
[formula omitted]-regular induced subgraph (1) 1
algorithm (1) 1
algorithm analysis and problem complexity (1) 1
amortized analysis (1) 1
applied mathematics (1) 1
approximate counting (1) 1
approximation algorithms (1) 1
approximation scheme (1) 1
augmenting graph (1) 1
average degree (1) 1
ball graph (1) 1
base cardinality of a vertex k-path cover (1) 1
bipanconnectivity (1) 1
bipartite graph (1) 1
bounded degree (1) 1
bounds (1) 1
cartesian product (1) 1
color (1) 1
color coding (1) 1
coloring (1) 1
community detection (1) 1
complete bipartite graph (1) 1
computer and information science (1) 1
computer communication networks (1) 1
computer network protocols (1) 1
computer science - discrete mathematics (1) 1
computer science applications (1) 1
computer science, hardware & architecture (1) 1
computer science, interdisciplinary applications (1) 1
computer systems organization and communication networks (1) 1
computer-netzwerk (1) 1
connected [formula omitted]-path vertex cover (1) 1
connected [formula omitted]-subgraph cover (1) 1
connected k -path vertex cover (1) 1
connected k-subgraph vertex cover (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete Applied Mathematics, ISSN 0166-218X, 05/2016, Volume 205, pp. 101 - 108
A vertex subset C of a connected graph G is called a connected k-path vertex cover (CVCPk) if every path on k vertices contains at least one vertex from C, and... 
Tree | Connected [formula omitted]-path vertex cover | Approximation algorithm | Girth | Weight | Connected k-path vertex cover | Algorithms
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 09/2013, Volume 161, Issue 13-14, pp. 1943 - 1949
A subset S of vertices of a graph G is called a vertex k-path cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the... 
Regular graphs | Grids | Average degree | [formula omitted]-path vertex cover | k-path vertex cover | MATHEMATICS, APPLIED | BIPARTITE GRAPHS
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 04/2019, Volume 347, pp. 723 - 733
A k-path vertex cover (VCPk) is a vertex set C of graph G such that every path of G on k vertices has at least one vertex in C. Because of its background in... 
Approximation algorithm | Non-submodular potential function | Weight | Connected k-path vertex cover | MATHEMATICS, APPLIED | SET | P-3 PROBLEM
Journal Article
Discrete Mathematics, ISSN 0012-365X, 01/2013, Volume 313, Issue 1, pp. 94 - 100
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the... 
Vertex cover | Dissociation number | Independence number | [formula omitted]-path vertex cover | Graph products | k-path vertex cover | MATHEMATICS | TERMS | BIPARTITE GRAPHS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 07/2016, Volume 339, Issue 7, pp. 1935 - 1939
The 3-path vertex cover problem is an extension of the well-known vertex cover problem. It asks for a vertex set S⊆V(G) of minimum cardinality such that G−S... 
Vertex cover | Crown reduction | [formula omitted]-path vertex cover | Kernelization | k-path vertex cover | MATHEMATICS | P-3 PROBLEM | APPROXIMATION ALGORITHM | GRAPHS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2017, Volume 223, pp. 28 - 38
The minimum vertex cover problem and the minimum vertex partition problem are central problems in graph theory and many generalisations are known. Two examples... 
Forbidden subgraphs | [formula omitted]-path partition | [formula omitted]-path vertex cover | k-path partition | k-path vertex cover | MATHEMATICS, APPLIED | P-3 PROBLEM | APPROXIMATION ALGORITHM | DISSOCIATION NUMBER | BIPARTITE GRAPHS | Computer science | Hardness | Algebra
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2015, Volume 187, pp. 111 - 119
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the... 
Vertex cover | Rooted product | Dissociation number | Independence number | [formula omitted]-path vertex cover | k-path vertex cover | MATHEMATICS, APPLIED | P-3 PROBLEM | TERMS | APPROXIMATION ALGORITHM | BIPARTITE GRAPHS
Journal Article
Information Processing Letters, ISSN 0020-0190, 03/2017, Volume 119, pp. 9 - 13
•We studied the minimum k-path vertex cover problem (VCPk) in ball graph for general k.•A PTAS for VCPk is presented for a ball graph with bounded... 
Approximation algorithms | PTAS | k-path vertex cover | Ball graph | SET | P-3 PROBLEM | COMPUTER SCIENCE, INFORMATION SYSTEMS | APPROXIMATION ALGORITHM | CUBIC GRAPHS | DELETION
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 08/2018, Volume 331, pp. 69 - 79
For a graph G and a positive integer k, a subset S of vertices of G is called a k-path vertex cover if S intersects all paths of order k in G. The cardinality... 
Lexicographic product | Strong product | k-path vertex cover | Complete bipartite graph | Cartesian product | MATHEMATICS, APPLIED | INDEPENDENCE NUMBER | P-3 PROBLEM | APPROXIMATION ALGORITHM | DISSOCIATION NUMBER
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 7/2018, Volume 36, Issue 1, pp. 35 - 43
Journal Article
Journal of Global Optimization, ISSN 0925-5001, 06/2013, Volume 56, Issue 2, pp. 449 - 458
In the Minimum k-Path Connected Vertex Cover Problem (MkPCVCP), we are given a connected graph G and an integer k a parts per thousand yen 2, and are required... 
k-Path connected vertex cover | Unit disk graph | PTAS | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | APPROXIMATION SCHEME | PROTOCOL | NETWORKS | Computer science | Studies | Graph theory | Analysis | Optimization | Remote sensors | Approximation | Wireless networks | Mathematical analysis | Disks | Graphs | Polynomials
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2014, Volume 8881, pp. 764 - 771
Journal Article
Global Journal of Pure and Applied Mathematics, ISSN 0973-1768, 2016, Volume 12, Issue 2, pp. 1403 - 1412
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 05/2019, Volume 91, Issue 1, pp. 73 - 87
The famous Kőnig‐Egerváry theorem is equivalent to the statement that the matching number equals the vertex cover number for every induced subgraph of some... 
vertex cover | Kőnig‐Egerváry theorem | bipartite graph | k‐path vertex cover | matching | k-path vertex cover | Kőnig-Egerváry theorem | MATHEMATICS | Konig-Egervary theorem | 3-PATH VERTEX COVER | ALGORITHMS | DISSOCIATION NUMBER | Mathematics | Combinatorics | Computer Science | Discrete Mathematics
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 05/2014, Volume 535, pp. 54 - 58
A subset F of vertices is called a connected k-subgraph cover (VCCk) if every connected subgraph on k vertices contains at least one vertex from F. The minimum... 
k-Path vertex cover | Connected k-subgraph vertex cover | Algorithms
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2017, Volume 10251, pp. 584 - 592
Conference Proceeding
Discrete Applied Mathematics, ISSN 0166-218X, 04/2018, Volume 239, pp. 119 - 124
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 07/2019, Volume 352, pp. 211 - 219
Vertex cover number, which is one of the most basic graph invariants, can be viewed as the smallest number of vertices that hit (or that belong to) every... 
Hitting set | k-path vertex cover | tidy graph | Decycling number | Quasi-spider | MATHEMATICS, APPLIED | P-4-tidy graph | PATH VERTEX COVER | COMPLEXITY | DISSOCIATION NUMBER
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2014, Volume 8630, Issue 1, pp. 114 - 126
Conference Proceeding
Applied Mathematics and Computation, ISSN 0096-3003, 07/2019, Volume 352, pp. 211 - 219
Vertex cover number, which is one of the most basic graph invariants, can be viewed as the smallest number of vertices that hit (or that belong to) every... 
Hitting set | k-path vertex cover | Decycling number | P4-tidy graph | Quasi-spider
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.