Amanote Research

Amanote Research

    RegisterSign In

New Mathematical Model for Finding Minimum Vertex Cut Set

doi 10.1109/icpci.2012.6486469
Full Text
Open PDF
Abstract

Available in full text

Date

September 1, 2012

Authors
Tina Beseri SevimHakan KutucuMurat Ersen Berberler
Publisher

IEEE


Related search

Finding Vertex-Surjective Graph Homomorphisms

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2012English

A Cubic Kernel for Feedback Vertex Set

English

Colour Transversal Vertex Covering Set

International Journal of Scientific and Innovative Mathematical Research
2016English

Finding Friends on a New Site Using Minimum Information

2014English

Crown Reductions for the Minimum Weighted Vertex Cover Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2002English

Minimum Cut Bases in Undirected Networks

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2010English

An Ensemble-Based Malware Detection Model Using Minimum Feature Set

Mendel
ControlSystems EngineeringDecision SciencesComputer ScienceComputational MathematicsArtificial IntelligenceTheoretical Computer Science
2019English

Minimum Verification Test Set for Combinational Circuit

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy