Narrow search
Showing 1 - 6 of 6
Cover Image
Optimal decision for the market graph identification problem in a sign similarity network
Kaljagin, Valerij Alekandrovič; Koldanov, A. P.; … - In: Analytical models for financial modeling and risk management, (pp. 313-327). 2018
Persistent link: https://www.econbiz.de/10011897184
Cover Image
Detecting critical nodes in sparse graphs
Arulselvan, Ashwin; Commander, Clayton W.; … - In: Computers & operations research : and their … 36 (2009) 7, pp. 2193-2200
Persistent link: https://www.econbiz.de/10003828495
Cover Image
Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
Fan, Neng; Pardalos, Panos M. - In: Journal of combinatorial optimization 23 (2012) 2, pp. 224-251
Persistent link: https://www.econbiz.de/10009507962
Cover Image
On the complexity of path problems in properly colored directed graphs
Granata, Donatella; Behdani, Behnam; Pardalos, Panos M. - In: Journal of combinatorial optimization 24 (2012) 4, pp. 459-467
Persistent link: https://www.econbiz.de/10009664558
Cover Image
Eavesdropping and jamming communication networks
Commander, Clayton W.; Pardalos, Panos M.; Ryabchenko, … - In: Cooperative networks : control and optimization ; [6th …, (pp. 101-112). 2008
Persistent link: https://www.econbiz.de/10003740827
Cover Image
A new exact maximum clique algorithm for large and massive sparse graphs
San Segundo, Pablo; Lopez, Alvaro; Pardalos, Panos M. - In: Computers & operations research : and their … 66 (2016), pp. 81-94
Persistent link: https://www.econbiz.de/10011428989