Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Graph-Theoretic Concepts in Computer Science

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

DOI10.1007/11604686zbMATH Open1171.68590MaRDI QIDQ5897577FDOQ5897577


Authors: Anne Berry, Alain Sigayret, Jeremy P. Spinrad Edit this on Wikidata


Publication date: 1 November 2006

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






Mathematics Subject Classification ID

Problems related to evolution (92D15) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)



Cited In (3)

  • Title not available (Why is that?)
  • Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
  • Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs





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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897577)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5897577&oldid=16700907"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 17:52. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki