16257 search results - page 58 / 3252 » D-finiteness: algorithms and applications |
77
Voted
ISSAC
2005
Springer
15 years 6 months ago
2005
Springer
WG
2005
Springer
15 years 6 months ago
2005
Springer
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
100
click to vote
WG
2005
Springer
15 years 6 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
104
Voted
GFKL
2004
Springer
15 years 6 months ago
2004
Springer
DSD
2003
IEEE
15 years 6 months ago
2003
IEEE