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

Graph-Theoretic Concepts in Computer Science

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

DOI10.1007/B104584zbMath1112.05321OpenAlexW4211210842MaRDI QIDQ5710815

Fábio Protti, Mitre C. Dourado, Jayme Luiz Szwarcfiter

Publication date: 8 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b104584



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (4)

The Helly property on subfamilies of limited size ⋮ Complexity aspects of generalized Helly hypergraphs ⋮ Characterization and recognition of generalized clique-Helly graphs ⋮ On the strong \(p\)-Helly property







This page was built for publication: Graph-Theoretic Concepts in Computer Science

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