ComputeTW

ComputeTW - An interactive platform for computing Treewidth of graphs.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 51 articles )

Showing results 1 to 20 of 51.
Sorted by year (citations)

1 2 3 next

  1. Milanič, Martin; Pivač, Nevena: Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (2021)
  2. Ait-Ferhat, Dehia; Juliard, Vincent; Stauffer, Gautier; Torres, Juan Andres: The (k)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing (2020)
  3. Bodewes, Jelco M.; Bodlaender, Hans L.; Cornelissen, Gunther; van der Wegen, Marieke: Recognizing hyperelliptic graphs in polynomial time (2020)
  4. Courcelle, Bruno: On quasi-planar graphs: clique-width and logical description (2020)
  5. Krause, Philipp Klaus; Larisch, Lukas; Salfelder, Felix: The tree-width of C (2020)
  6. Ouali, Abdelkader; Allouche, David; de Givry, Simon; Loudni, Samir; Lebbah, Yahia; Loukil, Lakhdar; Boizumault, Patrice: Variable neighborhood search for graphical model energy minimization (2020)
  7. Wang, Guanglei; Hijazi, Hassan: Exploiting sparsity for the min (k)-partition problem (2020)
  8. Aidun, Ivan; Dean, Frances; Morrison, Ralph; Yu, Teresa; Yuan, Julie: Graphs of gonality three (2019)
  9. Amarilli, Antoine; Bourhis, Pierre; Monet, Mikaël; Senellart, Pierre: Evaluating Datalog via tree automata and cycluits (2019)
  10. Benjumeda, Marco; Bielza, Concha; Larrañaga, Pedro: Learning tractable Bayesian networks in the space of elimination orders (2019)
  11. Gaspers, Serge; Gudmundsson, Joachim; Jones, Mitchell; Mestre, Julián; Rümmele, Stefan: Turbocharging treewidth heuristics (2019)
  12. Janssen, Remie; Jones, Mark; Kelk, Steven; Stamoulis, Georgios; Wu, Taoyang: Treewidth of display graphs: bounds, brambles and applications (2019)
  13. Wan, Peng-Fei; Chen, Xin-Zhuang: Computing the number of (k)-component spanning forests of a graph with bounded treewidth (2019)
  14. Bliem, Bernhard; Woltran, Stefan: Complexity of secure sets (2018)
  15. Burton, Benjamin A.; Maria, Clément; Spreer, Jonathan: Algorithms and complexity for Turaev-Viro invariants (2018)
  16. Courcelle, Bruno: From tree-decompositions to clique-width terms (2018)
  17. Kelk, Steven; Stamoulis, Georgios; Wu, Taoyang: Treewidth distance on phylogenetic trees (2018)
  18. Li, Bi; Moataz, Fatima Zahra; Nisse, Nicolas; Suchan, Karol: Minimum size tree-decompositions (2018)
  19. Nadara, Wojciech; Pilipczuk, Marcin; Rabinovich, Roman; Reidl, Felix; Siebertz, Sebastian: Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness (2018)
  20. van der Zanden, Tom C.; Bodlaender, Hans L.: Computing treewidth on the GPU (2018)

1 2 3 next