✦ LIBER ✦

Maximum Cardinality Search for Computing Minimal Triangulations of Graphs

✍ Scribed by Anne Berry; Jean R. S. Blair; Pinar Heggernes; Barry W. Peyton

Book ID: 106148535
Publisher: Springer
Year: 2004
Tongue: English
Weight: 146 KB
Volume: 39
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-004-1084-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

DNA Computing of Bipartite Graphs for Ma

DNA Computing of Bipartite Graphs for Maximum Matching

✍ Shiying Wang 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 101 KB

Computation of minimal rank and path cov

Computation of minimal rank and path cover number for certain graphs

✍ Francesco Barioli; Shaun Fallat; Leslie Hogben 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 290 KB

Heuristics for Similarity Searching of C

Heuristics for Similarity Searching of Chemical Graphs Using a Maximum Common Edge Subgraph Algorithm

✍ Raymond, J.W.; Gardiner, E.J.; Willett, P. 📂 Article 📅 2002 🏛 American Chemical Society 🌐 English ⚖ 143 KB

An output sensitive algorithm for comput

An output sensitive algorithm for computing a maximum independent set of a circle graph

✍ Nicholas Nash; David Gregg 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 181 KB

On the Complexity of Searching for a Max

On the Complexity of Searching for a Maximum of a Function on a Quantum Computer

✍ Maciej Goćwin 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 123 KB

[Lecture Notes in Computer Science] Appl

[Lecture Notes in Computer Science] Applications of Evolutionary Computing Volume 2611 || Searching for Maximum Cliques with Ant Colony Optimization

✍ Cagnoni, Stefano; Johnson, Colin G.; Cardalda, Juan J. Romero; Marchiori, Elena; 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 183 KB

This book constitutes the joint refereed proceedings of six workshops, EvoWorkshops 2003, held together with EuroGP 2003 in Essex, UK in April 2003. The 63 revised full papers presented were carefully reviewed and selected from a total of 109 submissions. In accordance with the six workshops covered