9 search results - page 1 / 2 » Monomial Ideals and Planar Graphs |
AAECC
1999
Springer
13 years 9 months ago
1999
Springer
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
INFOCOM
2011
IEEE
12 years 9 months ago
2011
IEEE
—Extracting planar graph from network topologies is of great importance for efficient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topol...
ORDER
2008
13 years 5 months ago
2008
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthog...
JNW
2007
13 years 5 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...