The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase st-numbering (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1976-2011 (12)
Publication types (Num. hits)
article(7) inproceedings(5)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 13 occurrences of 13 keywords

Results
Found 12 publication records. Showing 12 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
2Mohammad Mursalin Akon, Shah Asaduzzaman, Md. Saidur Rahman, Mitsuji Matsumoto Proposal for st-Routing Protocol. Search on Bibsonomy Telecommunication Systems The full citation details ... 2004 DBLP  DOI  BibTeX  RDF biconnected graph, st-numbering, routing protocol, multi-path routing
2Kwan Woo Ryu, Joseph JáJá Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF linear speedup, basic graph problems, tree expression evaluation, st-numbering, one-port communication, parallel algorithms, computational complexity, load balancing, graph theory, sorting, sorting, graph algorithms, biconnected components, list ranking, graph problems, hypercube algorithm, hypercube algorithms, ear decomposition
1Takaaki Mizuki, Satoru Nakayama, Hideaki Sone An Application of ST-Numbering to Secret Key Agreement. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1John M. Boyer A New Method for Efficiently Generating Planar Graph Visibility Representations. Search on Bibsonomy Graph Drawing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Charalampos Papamanthou, Ioannis G. Tollis Applications of Parameterized st-Orientations in Graph Drawing Algorithms. Search on Bibsonomy Graph Drawing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Rohan F. M. Aranha, C. Pandu Rangan An Efficient Distributed Algorithm For st-numbering The Verices Of A Biconnected Graph Search on Bibsonomy J. UCS The full citation details ... 1995 DBLP  BibTeX  RDF
1Eliezer Dekel, Jie Hu Parallel Dynamic st-numbering and Applications. Search on Bibsonomy IPPS The full citation details ... 1993 DBLP  BibTeX  RDF
1Hillel Gazit Optimal EREW Parallel Algorithms for Connectivity, Ear Decomposition and st-Numbering of Planar Graphs. Search on Bibsonomy IPPS The full citation details ... 1991 DBLP  BibTeX  RDF
1Yael Maon, Baruch Schieber, Uzi Vishkin Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
1Yael Maon, Baruch Schieber, Uzi Vishkin Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract). Search on Bibsonomy Aegean Workshop on Computing The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
1Shimon Even, Robert Endre Tarjan Corrigendum: Computing an st-Numbering. TCS 2(1976):339-344. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1977 DBLP  BibTeX  RDF
1Shimon Even, Robert Endre Tarjan Computing an st -Numbering. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #12 of 12 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.