Home
Random
Nearby
Log in
Settings
Donate Now
If Wikipedia is useful to you, please give today.
About Wikipedia
Disclaimers
Search
Talk:Decomposition method (constraint satisfaction): Difference between revisions
Article
Talk
Language
Watch
View history
Edit
Browse history interactively
← Previous edit
Next edit →
Content deleted
Content added
Visual
Wikitext
Revision as of 19:44, 13 April 2006
edit
Tizio
(
talk
|
contribs
)
Extended confirmed users
13,769
edits
acyclicity
← Previous edit
Revision as of 15:24, 21 April 2006
edit
undo
Tizio
(
talk
|
contribs
)
Extended confirmed users
13,769
edits
drawing done
Next edit →
Line 1:
To do:
* drawing on an example, similar to that at [[Constraint satisfaction dual problem]]
* <s>condition equivalent to hypergraph acyclicity</s> this is said in tree clustering; move above?
* clique-width
Add topic