{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/45368"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/45368","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Minimal PMU placement for graph observability: a decomposition approach","abstract":"This thesis explores the PMU placement problem, that is, the placement of a minimal number of Phase Measurement Units (PMUs) on the nodes of a power system graph such that the entire graph is observed. The NP-completeness of PMU placement for planar bipartite graphs is shown. PMU placement algorithms are developed for graphs of bounded tree width, such as trees and outer planar graphs. Graph decompositions are used to develop efficient algorithms that produce minimal PMU covers. These algorithms are developed, analyzed, and compared theoretically. Algorithm animations were used in the study to develop insight into the problem and to understand algorithm behavior.","abstract_html":"This thesis explores the PMU placement problem, that is, the placement of a minimal number of Phase Measurement Units (PMUs) on the nodes of a power system graph such that the entire graph is observed. The NP-completeness of PMU placement for planar bipartite graphs is shown. PMU placement algorithms are developed for graphs of bounded tree width, such as trees and outer planar graphs. Graph decompositions are used to develop efficient algorithms that produce minimal PMU covers. These algorithms are developed, analyzed, and compared theoretically. Algorithm animations were used in the study to develop insight into the problem and to understand algorithm behavior.","abstract_has_math":false,"creators":["Brueni, Dennis J."],"institution":"Virginia Tech","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Computer Science and Applications","degree_department":"Computer Science and Applications","school":null,"contributors":[],"advisors":[],"committee_chairs":["Heath, Lenwood S."],"committee_members":["Allison, Donald C. S.","Boisen, Monte B. Jr."],"year":1993,"date_issued":"1993-12-06","date_published":"1993-12-06","updated_at":"2026-07-24T05:56:42Z","subjects":[],"languages":["en"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-10312009-020314"],"render_values":[{"text":"etd-10312009-020314","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/45368","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["Heath, Lenwood S."]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Allison, Donald C. S.","Boisen, Monte B. Jr."]},{"key":"dc:contributor.department","label":"Department","values":["Computer Science and Applications"]},{"key":"dc:creator","label":"Author","values":["Brueni, Dennis J."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T21:48:31Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T21:48:31Z","2009-10-31"]},{"key":"dc:date.issued","label":"Date","values":["1993-12-06"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science and Applications"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-10312009-020314"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/45368"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis explores the PMU placement problem, that is, the placement of a minimal number of Phase Measurement Units (PMUs) on the nodes of a power system graph such that the entire graph is observed. The NP-completeness of PMU placement for planar bipartite graphs is shown. PMU placement algorithms are developed for graphs of bounded tree width, such as trees and outer planar graphs. Graph decompositions are used to develop efficient algorithms that produce minimal PMU covers. These algorithms are developed, analyzed, and compared theoretically. Algorithm animations were used in the study to develop insight into the problem and to understand algorithm behavior."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["BTD"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Minimal PMU placement for graph observability: a decomposition approach"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Heath, Lenwood S."],"dc:contributor.committeemember":["Allison, Donald C. S.","Boisen, Monte B. Jr."],"dc:contributor.department":["Computer Science and Applications"],"dc:creator":["Brueni, Dennis J."],"dc:date.accessioned":["2014-03-14T21:48:31Z"],"dc:date.available":["2014-03-14T21:48:31Z","2009-10-31"],"dc:date.issued":["1993-12-06"],"dc:description.abstract":["This thesis explores the PMU placement problem, that is, the placement of a minimal number of Phase Measurement Units (PMUs) on the nodes of a power system graph such that the entire graph is observed. The NP-completeness of PMU placement for planar bipartite graphs is shown. PMU placement algorithms are developed for graphs of bounded tree width, such as trees and outer planar graphs. Graph decompositions are used to develop efficient algorithms that produce minimal PMU covers. These algorithms are developed, analyzed, and compared theoretically. Algorithm animations were used in the study to develop insight into the problem and to understand algorithm behavior."],"dc:description.degree":["Master of Science"],"dc:format.medium":["BTD"],"dc:format.mimetype":["application/pdf"],"dc:identifier.other":["etd-10312009-020314"],"dc:identifier.uri":["http://hdl.handle.net/10919/45368"],"dc:language.iso":["en"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Minimal PMU placement for graph observability: a decomposition approach"],"dc:type":["Thesis"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Computer Science and Applications"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-24T05:56:42Z"}