Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Clique detection in directed graphs: A new algorithm

From MaRDI portal
Publication:1219559
Jump to:navigation, search

DOI10.1016/0771-050X(75)90035-2zbMath0311.68026OpenAlexW1989636045MaRDI QIDQ1219559

Wim Meeusen, Ludo Cuyvers

Publication date: 1975

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0771-050x(75)90035-2



Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)


Related Items

Clique detection for nondirected graphs: Two new algorithms ⋮ The maximum clique problem



Cites Work

  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1219559&oldid=13289644"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 07:54.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki