Skoči na glavni sadržaj

Izvorni znanstveni članak

Computing the Szeged Index

Janez Žerovnik ; Institute of Mathematics, Physics and Mechanics, Department of Theoretical Computer Science, Jadranska 19, Ljubljana, Slovenia


Puni tekst: engleski pdf 1.873 Kb

str. 837-843

preuzimanja: 512

citiraj


Sažetak

We give an explicit algorithm for computing the Szeged index of a
graph which runs in O(mn) time, where n is the number of nodes
and m is the number of edges.

Ključne riječi

Hrčak ID:

177115

URI

https://hrcak.srce.hr/177115

Datum izdavanja:

1.11.1996.

Posjeta: 1.009 *