Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Reducible graph"”.
-
Implementation issues for Feo and Provan's delta-wye-delta reduction algorithm
A graph is planar if it can be drawn on the plane with no crossing edges. A graph that can be efficiently reduced to a single edge by repeatedly using one of the six transformations (loop, pendant, series, parallel, delta-wye and wye-delta) in any order is called a D.Y 6-reducible graph and the …
-
Edge modification on perfect and reducible graphs with application to watermarking
In graph modification problems, we have to repair, improve, or adjust a graph to satisfy appropriate properties while minimizing the cost of the modification. The study of graph modification problems is crucial to computer science as they find applications in different areas, such as biology, …