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

Kernel and fast algorithm for dense triplet inconsistency

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

DOI10.1007/978-3-642-13562-0_23zbMATH Open1284.68296OpenAlexW2096889157MaRDI QIDQ3569080FDOQ3569080


Authors: Sylvain Guillemot, Matthias Mnich Edit this on Wikidata


Publication date: 17 June 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-13562-0_23




Recommendations

  • Kernel and fast algorithm for dense triplet inconsistency
  • New results on optimizing rooted triplets consistency
  • New Results on Optimizing Rooted Triplets Consistency
  • scientific article; zbMATH DE number 7564377
  • Determining the consistency of resolved triplets and fan triplets


Mathematics Subject Classification ID

Problems related to evolution (92D15) Analysis of algorithms and problem complexity (68Q25)



Cited In (3)

  • Kernel and fast algorithm for dense triplet inconsistency
  • Determining the consistency of resolved triplets and fan triplets
  • Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique





This page was built for publication: Kernel and fast algorithm for dense triplet inconsistency

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

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