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

La reduction minimale d'un graphe à une reunion de cliques

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

DOI10.1016/0012-365X(74)90030-2zbMath0288.05127MaRDI QIDQ1846436

Ioan Tomescu

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)



Mathematics Subject Classification ID

Graph theory (05C99)


Related Items (8)

A method of enumeration of negative cycles of a signed graph ⋮ Graph clustering with a constraint on cluster sizes ⋮ Unnamed Item ⋮ The median procedure in cluster analysis and social choice theory ⋮ On a semi-superwized graph clustering problem ⋮ Optimal clustering of multipartite graphs ⋮ Approximation algorithms for graph approximation problems ⋮ Unnamed Item



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: La reduction minimale d'un graphe à une reunion de cliques

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1846436&oldid=14229370"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki