Algorithmic Aspects of Vertex Elimination on Graphs

SIAM Journal on Computing - United States
doi 10.1137/0205021
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Algorithmic Aspects of Secure Connected Domination in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

On Limit Graphs of Finite Vertex-Primitive Graphs

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2007English

Vertex Maps on Graphs-Trace Theorems

Fixed Point Theory and Applications
GeometryApplied MathematicsTopology
2011English

On R - Dynamic Vertex Coloring of Some Graphs

Kongunadu Research Journal
2020English

On Integral Sum Graphs With a Saturated Vertex

Czechoslovak Mathematical Journal
Mathematics
2010English

On Vertex Ranking for Permutation and Other Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Revisiting the Vertex Cover of Graphs

Applied Mathematical Sciences
2015English

Algorithmic Aspects of Tree Amalgamation

Journal of Algorithms
2000English

On Hamiltonicity of Vertex-Transitive Graphs and Digraphs of Orderp4

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy