Sökning: "Subgraph isomorphism"
Hittade 3 avhandlingar innehållade orden Subgraph isomorphism.
1. New Results on Combinatorial Algorithms
Sammanfattning : In this thesis improved upper bounds for several important combinatorial problems are provided. Below is a list of the main results showed in the thesis. The problem of determining whether a k-connected partial k-tree is isomorphic to subgraph of another partial k-tree is shown to be solvable in time O(nk+2). LÄS MER
2. Certifying Correctness for Combinatorial Algorithms : by Using Pseudo-Boolean Reasoning
Sammanfattning : Over the last decades, dramatic improvements in combinatorialoptimisation algorithms have significantly impacted artificialintelligence, operations research, and other areas. These advances,however, are achieved through highly sophisticated algorithms that aredifficult to verify and prone to implementation errors that can causeincorrect results. LÄS MER
3. Automated System Level Software Testing of Networked Embedded Systems
Sammanfattning : Embedded systems are ubiquitous and play critical roles in management systems for industry and transport. Software failures in these domains may lead to loss of production or even loss of life, so the software in these systems needs to be reliable. LÄS MER