A Fast Algorithm to Remove Proper and Homogeneous Pairs of Cliques (While Preserving Some Graph Invariants)

Operations Research Letters- Netherlands

doi 10.1016/j.orl.2011.04.002

Full Text

Abstract

Available in

Date

Authors

Publisher

Elsevier BV

Related search

Some Invariants of Certain Pairs of Hypersurfaces

Bulletin of the American Mathematical Society
1945English

Wiener-Type Invariants of Some Graph Operations

Filomat
Mathematics
2009English

A Fast Algorithm to Racetrack Filter Multiaxial Histories Preserving Load Shape

MATEC Web of Conferences
Materials ScienceEngineeringChemistry
2019English

A Theorem Concerning the Invariants of Linear Homogeneous Groups, With Some Applications to Substitution-Groups

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1904English

Fast Algorithm for Graph Isomorphism Testing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Relationship Between Augmented Eccentric Connectivity Index and Some Other Graph Invariants

International Journal of Advanced Mathematical Sciences
2013English

A Fast Kernel-Based Multilevel Algorithm for Graph Clustering

2005Estonian

The Proper Diameter of a Graph

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

A Review on Eigen Values of Adjacency Matrix of Graph With Cliques

2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy