Extension and Its Price for the Connected Vertex Cover Problem

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-030-25005-8_26
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Crown Reductions for the Minimum Weighted Vertex Cover Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

A Modified Hopfield Neural Network for the Minimum Vertex Cover Problem

IEEJ Transactions on Electronics, Information and Systems
Electronic EngineeringElectrical
2004English

Automatically Generated Algorithms for the Vertex Coloring Problem

PLoS ONE
Multidisciplinary
2013English

The Upper Connected Vertex Detour Number of a Graph

Filomat
Mathematics
2012English

An Exact Algorithm for the Capacitated Vertex -Center Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2006English

Improved Algorithms for the 2-Vertex Disjoint Paths Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

An Inverse Eigenvalue Problem for an Arbitrary Multiply Connected Bounded Region: An Extension to Higher Dimensions

International Journal of Mathematics and Mathematical Sciences
Mathematics
1993English

Revisiting the Vertex Cover of Graphs

Applied Mathematical Sciences
2015English

Improved Upper Bounds for Partial Vertex Cover

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy