COST FUNCTION
A constraint programming Extension
Home
Biblio
Main Menu
Home
News
Teaching
Solver Demo
Benchmarks
Biblio
meeting
Search
About
last articles
resultats comparatif
resultats DFBBVE
Réunion projet octobre 2011
Lectures
Exercices
Project
Ficolofo
Benchmark
login
Username
Password
Remember Me
Forgot your password?
Forgot your username?
online
We have 112 guests online
Efficient algorithms for combinatorial problems on graphs with bounded decomposability --- A survey
Research Area:
Uncategorized
Year:
1985
Type of Publication:
Article
Authors:
Arnborg, S.
Journal:
BIT
Volume:
25
Pages:
2-23
BibTex:
@article{Arnborg85, author = "S. Arnborg", journal = "BIT", pages = "2-23", title = "{E}fficient algorithms for combinatorial problems on graphs with bounded decomposability --- {A} survey", volume = "25", year = "1985", }
[Bibtex]
[RIS]
[MODS]
[ Back ]