• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 20 matches

• 2011
• 
  Nawarat Ananchuen, Watcharaphong Ananchuen, Michael D. Plummer:
  Domination in Graphs. Structural Analysis of Complex Networks 2011: 73-104
• 
  Gerhard Benadé:
  A Chromatic Metric on Graphs. Structural Analysis of Complex Networks 2011: 335-356
• 
  Mieczyslaw Borowiecki:
  Partitions of Graphs. Structural Analysis of Complex Networks 2011: 27-47
• 
  Bostjan Bresar, Matjaz Kovse, Aleksandra Tepeh:
  Geodetic Sets in Graphs. Structural Analysis of Complex Networks 2011: 197-218
• 
  Sebastian M. Cioaba:
  Some Applications of Eigenvalues of Graphs. Structural Analysis of Complex Networks 2011: 357-379
• 
  Joanna A. Ellis-Monaghan, Criel Merino:
  Graph Polynomials and Their Applications I: The Tutte Polynomial. Structural Analysis of Complex Networks 2011: 219-255
• 
  Joanna A. Ellis-Monaghan, Criel Merino:
  Graph Polynomials and Their Applications II: Interrelations and Interpretations. Structural Analysis of Complex Networks 2011: 257-292
• 
  Frank Emmert-Streib:
  A Brief Introduction to Complex Networks and Their Analysis. Structural Analysis of Complex Networks 2011: 1-26
• 
  Jun Ichi Fujii:
  Spectrum and Entropy for Infinite Directed Graphs. Structural Analysis of Complex Networks 2011: 105-136
• 
  Wayne Goddard, Ortrud R. Oellermann:
  Distance in Graphs. Structural Analysis of Complex Networks 2011: 49-72
• 
  Petr Kovár:
  Decompositions and Factorizations of Complete Graphs. Structural Analysis of Complex Networks 2011: 169-196
• 
  Josef Lauri:
  Subgraphs as a Measure of Similarity. Structural Analysis of Complex Networks 2011: 319-334
• 
  Oliver Mason, Mark Verwoerd, Peter Clifford:
  Inference of Protein Function from the Structure of Interaction Networks. Structural Analysis of Complex Networks 2011: 439-461
• 
  Kengo Matsumoto:
  Application of Infinite Labeled Graphs to Symbolic Dynamical Systems. Structural Analysis of Complex Networks 2011: 137-168
• 
  Alexander Mehler:
  Minimum Spanning Markovian Trees: Introducing Context-Sensitivity into the Generation of Spanning Trees. Structural Analysis of Complex Networks 2011: 381-401
• 
  Jerry Scripps, Ronald Nussbaum, Pang-Ning Tan, Abdol-Hossein Esfahanian:
  Link-Based Network Mining. Structural Analysis of Complex Networks 2011: 403-419
• 
  Thomas Stoll:
  Reconstruction Problems for Graphs, Krawtchouk Polynomials, and Diophantine Equations. Structural Analysis of Complex Networks 2011: 293-317
• 
  Damir Vukicevic:
  Applications of Perfect Matchings in Chemistry. Structural Analysis of Complex Networks 2011: 463-482
• 
  Stefan Washietl, Tanja Gesell:
  Graph Representations and Algorithms in Computational Biology of RNA Secondary Structure. Structural Analysis of Complex Networks 2011: 421-437
• 
  Matthias Dehmer:
  Structural Analysis of Complex Networks. Birkhäuser / Springer 2011, ISBN 978-0-8176-4788-9 [contents]