On some polynomial solvable cases of the generalized minimum spanning tree problem.

Pop, Petrică Claudiu

Acta Universitatis Apulensis. Mathematics - Informatics (2005)

  • Volume: 10, page 189-195
  • ISSN: 1582-5329

How to cite

top

Pop, Petrică Claudiu. "On some polynomial solvable cases of the generalized minimum spanning tree problem.." Acta Universitatis Apulensis. Mathematics - Informatics 10 (2005): 189-195. <http://eudml.org/doc/130266>.

@article{Pop2005,
author = {Pop, Petrică Claudiu},
journal = {Acta Universitatis Apulensis. Mathematics - Informatics},
keywords = {generalized minimum spanning tree problem; -hard problems; -hard problems},
language = {eng},
pages = {189-195},
publisher = {"1 Decembrie 1918" University of Alba Iulia, Department of Mathematics and Informatics},
title = {On some polynomial solvable cases of the generalized minimum spanning tree problem.},
url = {http://eudml.org/doc/130266},
volume = {10},
year = {2005},
}

TY - JOUR
AU - Pop, Petrică Claudiu
TI - On some polynomial solvable cases of the generalized minimum spanning tree problem.
JO - Acta Universitatis Apulensis. Mathematics - Informatics
PY - 2005
PB - "1 Decembrie 1918" University of Alba Iulia, Department of Mathematics and Informatics
VL - 10
SP - 189
EP - 195
LA - eng
KW - generalized minimum spanning tree problem; -hard problems; -hard problems
UR - http://eudml.org/doc/130266
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.