getOdC

Computes the Off-Diagonal Complexity as defined by J.C. Claussen.

Version 1.1.0.0 (525 Bytes)
616 Downloads
(0)
22 Jan 2009

You are now following this Submission

Based on Physica A 375 (2007) 365–373.

'g' must be the adjacency matrix of the graph of interest.

It has not been verified because the Helicobacter pylori protein interaction graph used as the example in the article could not be obtained.

Cite As

Santiago Balestrini (2026). getOdC (https://www.mathworks.com/matlabcentral/fileexchange/22761-getodc), MATLAB Central File Exchange. Retrieved .

Categories

Find more on Graph and Network Algorithms in Help Center and MATLAB Answers

General Information

MATLAB Release Compatibility

  • Compatible with any release

Platform Compatibility

  • Windows
  • macOS
  • Linux
Open in new tab
Version Published Release Notes
1.1.0.0

Now any non-zero value in 'g' is made one. Preallocated 'a' for speed. Corrected the citation of the original article by Claussen in the commented header.
1.0.0.0