Search results for "Subdigraph"

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

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
57	Hyunmin Park, Dharma P. Agrawal	A Topology-Independent Generic Methodology for Deadlock-Free Wormhole Routing.	HPCA	1996	DBLP DOI BibTeX RDF	Subdigraph, Hypercube, Mesh, Adaptive Routing, Virtual Channel, Torus, Channels, Wormhole, Deadlock-free Routing Algorithm
57	Hyunmin Park, Dharma P. Agrawal	Generic Methodologies for Deadlock-Free Routing.	IPPS	1996	DBLP DOI BibTeX RDF	Subdigraph, Hypercube, Mesh, Adaptive Routing, Virtual Channel, Torus, Channels, Wormhole, Virtual Cut-through, Store-and-Forward, Deadlock-free Routing Algorithm
34	S. Ramachandran, P. Bhanumathy	Digraph Isomorpshism Using Subdigraph Equivalent Vertices And Degree Pair Association.	Ars Comb.	2018	DBLP BibTeX RDF
34	Susana Furtado, Charles R. Johnson, Carlos Marijuán, Miriam Pisonero	Comparison on the spectral radii of weighted digraphs that differ in a certain subdigraph.	Electron. Notes Discret. Math.	2016	DBLP DOI BibTeX RDF
34	Hadi Saboohi, Sameem Abdul Kareem	An automatic subdigraph renovation plan for failure recovery of composite semantic Web services.	Frontiers Comput. Sci.	2013	DBLP DOI BibTeX RDF
34	Cosimo Federico Ardito, Donato Di Paola, Andrea Gasparri	Decentralized estimation of the minimum strongly connected subdigraph for robotic networks with limited field of view.	CDC	2012	DBLP DOI BibTeX RDF
34	Jørgen Bang-Jensen, Anders Yeo	The minimum spanning strong subdigraph problem is fixed parameter tractable.	Discret. Appl. Math.	2008	DBLP DOI BibTeX RDF
34	Jørgen Bang-Jensen, Anders Yeo	The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs.	J. Algorithms	2001	DBLP DOI BibTeX RDF
34	Rudolf Müller	On the transitive acyclic subdigraph polytope.	IPCO	1993	DBLP BibTeX RDF
34	Richard A. Brualdi, Rachel Manber	On strong digraphs with a unique minimally strong subdigraph.	Discret. Math.	1988	DBLP DOI BibTeX RDF
34	Michael Jünger	Polyhedral combinatorics and the acyclic subdigraph problem.		1985	RDF
24	Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan	Dominating Connectivity and Reliability of Heterogeneous Sensor Networks.	PerCom Workshops	2006	DBLP DOI BibTeX RDF
24	Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo	Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
24	Sounaka Mishra, Kripasindhu Sikdar	On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.	IFIP TCS	2000	DBLP DOI BibTeX RDF	NP-optimization problems, Minimaximal and maximinimal NP-optimization problems, L-reduction, Approximation algorithms, Hardness of approximation, APX-hardness
24	Meinrad Funke, Gerhard Reinelt	A Polyhedral Approach to the Feedback Vertex Set Problem.	IPCO	1996	DBLP DOI BibTeX RDF
24	Alfs T. Berztiss	A Backtrack Procedure for Isomorphism of Directed Graphs.	J. ACM	1973	DBLP DOI BibTeX RDF