|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 21 occurrences of 13 keywords
|
|
|
Results
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCA ![In: Proceedings of the Second International Symposium on High-Performance Computer Architecture, San Jose, CA, USA, February 3-7, 1996, pp. 191-200, 1996, IEEE Computer Society, 0-8186-7237-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '96, The 10th International Parallel Processing Symposium, April 15-19, 1996, Honolulu, Hawaii, USA, pp. 638-643, 1996, IEEE Computer Society, 0-8186-7255-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 137, pp. 373-394, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 54, pp. 85-90, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
34 | Hadi Saboohi, Sameem Abdul Kareem |
An automatic subdigraph renovation plan for failure recovery of composite semantic Web services. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Frontiers Comput. Sci. ![In: Frontiers Comput. Sci. 7(6), pp. 894-913, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: Proceedings of the 51th IEEE Conference on Decision and Control, CDC 2012, December 10-13, 2012, Maui, HI, USA, pp. 5304-5309, 2012, IEEE, 978-1-4673-2065-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
34 | Jørgen Bang-Jensen, Anders Yeo |
The minimum spanning strong subdigraph problem is fixed parameter tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 156(15), pp. 2924-2929, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 41(1), pp. 1-19, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Rudolf Müller |
On the transitive acyclic subdigraph polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993, pp. 463-477, 1993, CIACO. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP BibTeX RDF |
|
34 | Richard A. Brualdi, Rachel Manber |
On strong digraphs with a unique minimally strong subdigraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 71(1), pp. 1-7, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
34 | Michael Jünger |
Polyhedral combinatorics and the acyclic subdigraph problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1985 |
RDF |
|
24 | Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan |
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PerCom Workshops ![In: 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 13-17 March 2006, Pisa, Italy, pp. 91-95, 2006, IEEE Computer Society, 0-7695-2520-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 18(3), pp. 499-506, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, pp. 186-199, 2000, Springer, 3-540-67823-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings, pp. 445-459, 1996, Springer, 3-540-61310-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Alfs T. Berztiss |
A Backtrack Procedure for Isomorphism of Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 20(3), pp. 365-377, 1973. The full citation details ...](Pics/full.jpeg) |
1973 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #16 of 16 (100 per page; Change: )
|
|