ICAR Research Data Repository for Knowledge Management
PRINCIPAL LATTICE OF PARTITIONS OF SUBMODULAR FUNCTIONS ON GRAPHS - FAST ALGORITHMS FOR PRINCIPAL PARTITION AND GENERIC RIGIDITY
DSpace at IIT Bombay
View Archive Info| Field | Value | |
| Title |
PRINCIPAL LATTICE OF PARTITIONS OF SUBMODULAR FUNCTIONS ON GRAPHS - FAST ALGORITHMS FOR PRINCIPAL PARTITION AND GENERIC RIGIDITY
|
|
| Creator |
PATKAR, S
NARAYANAN, H |
|
| Subject |
systems
|
|
| Description |
In this paper we use a single unifying approach (which we call the Principal Lattice of Partitions approach) to construct simple and fast algorithms for problems including and related to the ''Principal Partition' and the ''Generic Rigidity'' of graphs. Most of our algorithms are at least as fast as presently known algorithms fox these problems, while our algorithm for Principal Partition problem (complete partition and the partial orders for all critical values) runs in O(\E\\V\2log2\V\) time and is the fastest known so far.
|
|
| Publisher |
SPRINGER VERLAG
|
|
| Date |
2011-08-30T09:51:38Z
2011-12-26T12:58:53Z 2011-12-27T05:49:33Z 2011-08-30T09:51:38Z 2011-12-26T12:58:53Z 2011-12-27T05:49:33Z 1992 |
|
| Type |
Article
|
|
| Identifier |
LECTURE NOTES IN COMPUTER SCIENCE, 650(), 41-50
0302-9743 http://dspace.library.iitb.ac.in/xmlui/handle/10054/12273 http://hdl.handle.net/10054/12273 |
|
| Language |
en
|
|