Publication | Open Access

Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth

Complexity ResultsGraph MinorDirected GraphNetwork ScienceGraph TheoryGraph AlgorithmsCritical NodesEngineeringStructural Graph TheoryExtremal Graph TheoryNetwork AnalysisEducationComputational ComplexityUndirected GraphsComputer ScienceDiscrete MathematicsCombinatorial OptimizationGraph Algorithm