Search results for "path covers"

Found 14 publication records. Showing 14 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim	Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements.	IEEE Trans. Computers	2009	DBLP DOI BibTeX RDF
2	Jung-Heum Park	One-to-Many Disjoint Path Covers in a Graph with Faulty Elements.	COCOON	2004	DBLP DOI BibTeX RDF
2	Antonia Bertolino, Martina Marré	Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	program branch testing, program flowgraph, program inputs, ddgraph, graph theoretic principles, arc trees, unconstrained arcs, implied tree, recursive iteration, software analysis tool, automated testing tool, software tools, program testing, flexibility, trees (mathematics), dominance, program diagnostics, control flow analysis, simplicity, implication, program control structures, flow graphs, dominator tree, selection strategy, infeasible paths, software testing tool, path covers
1	Xie-Bin Chen	Paired many-to-many disjoint path covers of hypercubes with faulty edges.	Inf. Process. Lett.	2012	DBLP DOI BibTeX RDF
1	Jae-Ha Lee, Jung-Heum Park	General-demand disjoint path covers in a graph with faulty elements.	Int. J. Comput. Math.	2012	DBLP DOI BibTeX RDF
1	Yuan-Kang Shih, Shin-Shin Kao	One-to-one disjoint path covers on k-ary n-cubes.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Sook-Yeon Kim, Jae-Ha Lee, Jung-Heum Park	Disjoint path covers in recursive circulants G(2m, 4) with faulty elements.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Xie-Bin Chen	Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	Di Liu, Jing Li	Many-to-many n-disjoint path covers in n-dimensional hypercubes.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	Zhou Xu, Liang Xu	Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time.	ISAAC	2009	DBLP DOI BibTeX RDF	min-max vehicle routing, approximation algorithm, inapproximability, path covers
1	Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim	On the construction of paired many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements.	IPDPS	2008	DBLP DOI BibTeX RDF
1	Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim	Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements.	IEEE Trans. Parallel Distrib. Syst.	2006	DBLP DOI BibTeX RDF	fault-Hamiltonicity, strong Hamiltonicity, recursive circulants, restricted HL-graphs, Fault tolerance, graph theory, embedding, network topology
1	Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim	Many-to-many Disjoint Path Covers in a Graph with Faulty Elements.	ISAAC	2004	DBLP DOI BibTeX RDF
1	David G. Kirkpatrick, Madhukar K. Reddy, C. Pandu Rangan, Anand Srinivasan	Partial and Perfect Path Covers of Cographs.	Discrete Applied Mathematics	1998	DBLP DOI BibTeX RDF