Search Results

There are 13530 results for: content related to: Directed Graphs

VIEW

  1. 1 - 20
  2. 21 - 40
  3. 41 - 60
  4. 61 - 80
  5. Next >
  1. Long cycles in subgraphs of (pseudo)random directed graphs

    Journal of Graph Theory

    Volume 70, Issue 3, July 2012, Pages: 284–296, Ido Ben-Eliezer, Michael Krivelevich and Benny Sudakov

    Article first published online : 15 SEP 2011, DOI: 10.1002/jgt.20616

  2. Generalized loop-erased random walks and approximate reachability

    Random Structures & Algorithms

    Igor Gorodezky and Igor Pak

    Article first published online : 6 DEC 2012, DOI: 10.1002/rsa.20460

  3. Graph Algorithms

    Graphs: Theory and Algorithms

    K. Thulasiraman, M. N. S. Swamy, Pages: 306–389, 2011

    Published Online : 22 FEB 2011, DOI: 10.1002/9781118033104.ch11

  4. Matrices of a Graph

    Graphs: Theory and Algorithms

    K. Thulasiraman, M. N. S. Swamy, Pages: 126–178, 2011

    Published Online : 22 FEB 2011, DOI: 10.1002/9781118033104.ch6

  5. A type of centrality functions for a directed graph

    Electronics and Communications in Japan (Part I: Communications)

    Volume 66, Issue 5, 1983, Pages: 38–47, Genya Kishi and Masashi Takeuchi

    Article first published online : 12 SEP 2008, DOI: 10.1002/ecja.4400660506

  6. Longest cycles in sparse random digraphs

    Random Structures & Algorithms

    Michael Krivelevich, Eyal Lubetzky and Benny Sudakov

    Article first published online : 28 MAY 2012, DOI: 10.1002/rsa.20435

  7. Testing properties of directed graphs: acyclicity and connectivity

    Random Structures & Algorithms

    Volume 20, Issue 2, March 2002, Pages: 184–205, Michael A. Bender and Dana Ron

    Article first published online : 7 FEB 2002, DOI: 10.1002/rsa.10023

  8. Graphical Representation

    Graphical Models: Representations for Learning, Reasoning and Data Mining, Second Edition

    Christian Borgelt, Matthias Steinbrecher, Rudolf Kruse, Pages: 93–138, 2009

    Published Online : 4 AUG 2009, DOI: 10.1002/9780470749555.ch4

  9. Efficient algorithms for generalized cut-trees

    Networks

    Volume 21, Issue 5, August 1991, Pages: 505–520, Dan Gusfield and Dalit Naor

    Article first published online : 11 OCT 2006, DOI: 10.1002/net.3230210503

  10. Network science

    Annual Review of Information Science and Technology

    Volume 41, Issue 1, 2007, Pages: 537–607, Katy Börner, Soma Sanyal and Alessandro Vespignani

    Article first published online : 27 OCT 2008, DOI: 10.1002/aris.2007.1440410119

  11. Construction of robust class hierarchies

    Software: Practice and Experience

    Volume 30, Issue 5, 25 April 2000, Pages: 481–543, A. Frick, G. Goos, R. Neumann and W. Zimmermann

    Article first published online : 29 MAR 2000, DOI: 10.1002/(SICI)1097-024X(20000425)30:5<481::AID-SPE299>3.0.CO;2-S

  12. On ω-commuting graphs and their diameters

    Mathematische Nachrichten

    Volume 284, Issue 5-6, April 2011, Pages: 781–789, P. Raja and S. M. Vaezpour

    Article first published online : 14 MAR 2011, DOI: 10.1002/mana.200710148

  13. Iterating the branching operation on a directed graph

    Journal of Graph Theory

    Volume 24, Issue 3, March 1997, Pages: 257–265, Christos A. Athanasiadis

    Article first published online : 16 JAN 2004, DOI: 10.1002/(SICI)1097-0118(199703)24:3<257::AID-JGT7>3.0.CO;2-O

  14. Correlations for paths in random orientations of G(n,p) and G(n,m)

    Random Structures & Algorithms

    Volume 39, Issue 4, December 2011, Pages: 486–506, Sven Erick Alm, Svante Janson and Svante Linusson

    Article first published online : 15 MAR 2011, DOI: 10.1002/rsa.20358

  15. Shortest alternating path algorithms

    Networks

    Volume 4, Issue 4, 1974, Pages: 311–334, J. R. Brown

    Article first published online : 11 OCT 2006, DOI: 10.1002/net.3230040404

  16. On unavoidable digraphs in orientations of graphs

    Journal of Graph Theory

    Volume 11, Issue 4, Winter 1987, Pages: 453–462, Gary S. Bloom and Stefan A. Burr

    Article first published online : 4 OCT 2006, DOI: 10.1002/jgt.3190110402

  17. Variations on cops and robbers

    Journal of Graph Theory

    Volume 69, Issue 4, April 2012, Pages: 383–402, Alan Frieze, Michael Krivelevich and Po-Shen Loh

    Article first published online : 18 FEB 2011, DOI: 10.1002/jgt.20591

  18. Directed Graphs

    Graph Theory and Applications: With Exercises and Problems

    Jean-Claude Fournier, Pages: 83–96, 2010

    Published Online : 2 FEB 2010, DOI: 10.1002/9780470611548.ch4

  19. Minimal functional routes in directed graphs with dependent edges

    International Transactions in Operational Research

    Volume 20, Issue 3, May 2013, Pages: 391–409, Rui-Sheng Wang, Zhongyao Sun and Réka Albert

    Article first published online : 8 FEB 2013, DOI: 10.1111/itor.12007

  20. An improved direct labeling method for the max–flow min–cut computation in large hypergraphs and applications

    International Transactions in Operational Research

    Volume 10, Issue 1, January 2003, Pages: 1–11, Joachim Pistorius and Michel Minoux

    Article first published online : 12 FEB 2003, DOI: 10.1111/1475-3995.00389

VIEW

  1. 1 - 20
  2. 21 - 40
  3. 41 - 60
  4. 61 - 80
  5. Next >