Sciweavers

3145 search results - page 49 / 629
» Algebraic Linear Orderings
Sort
View
SWAT
2004
Springer
123views Algorithms» more  SWAT 2004»
15 years 6 months ago
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension
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...
Michel Habib, Fabien de Montgolfier, Christophe Pa...
99
Voted
CORR
2007
Springer
116views Education» more  CORR 2007»
15 years 16 days ago
Complexity of some Path Problems in DAGs and Linear Orders
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
Serge Burckel
103
Voted
LATIN
2004
Springer
15 years 6 months ago
Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank
In a preceding paper [6], automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite...
Olivier Carton, Chloe Rispal
GLOBECOM
2007
IEEE
15 years 7 months ago
Diversity Order of MMSE Single-Carrier Frequency Domain Linear Equalization
— In this paper we investigate the diversity order of single-carrier frequency domain equalizers (SC-FDE). Specifically, we look at minimum mean square error (MMSE) linear equal...
Ali Tajer, Aria Nosratinia
111
Voted
MOC
2002
98views more  MOC 2002»
15 years 7 days ago
Avoiding the order reduction of Runge-Kutta methods for linear initial boundary value problems
Abstract. A new strategy to avoid the order reduction of Runge-Kutta methods when integrating linear, autonomous, nonhomogeneous initial boundary value problems is presented. The s...
Mari Paz Calvo, Cesar Palencia