9532 search results - page 194 / 1907 » Logic, Graphs, and Algorithms |
155
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
138
click to vote
WG
2007
Springer
16 years 17 days ago
2007
Springer
NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the ...
186
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
163
click to vote
WALCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, a fast algorithm is proposed to calculate kth power of an n