• 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 222 matches

• 2019
• 
  Ali N. A. Koam, Ali Ahmad:
  Computation of Total Vertex Irregularity Strength of Theta Graphs. IEEE Access 7: 113826-113831 (2019)
• 
  Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx:
  Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms. Algorithmica 81(10): 3890-3935 (2019)
• 
  Gang Ma, Qiuju Bian, Jianfeng Wang:
  The weighted vertex PI index of (n, m)-graphs with given diameter. Applied Mathematics and Computation 354: 329-337 (2019)
• 
  Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
  On the End-Vertex Problem of Graph Searches. Discrete Mathematics & Theoretical Computer Science 21(1) (2019)
• 
  C. A. Weffort-Santos, C. N. Campos, Rafael C. S. Schouery:
  On the Complexity of Gap-[2]-vertex-labellings of Subcubic Bipartite Graphs. Electr. Notes Theor. Comput. Sci. 346: 725-734 (2019)
• 
  Nika Salia, Casey Tompkins, Oscar Zamora:
  An Erdős-Gallai type theorem for vertex colored graphs. Graphs and Combinatorics 35(3): 689-694 (2019)
• 
  Nasrin Mazaheri Soudani, Afsaneh Fatemi, Mohammadali Nematbakhsh:
  PPR-partitioning: a distributed graph partitioning algorithm based on the personalized PageRank vectors in vertex-centric systems. Knowl. Inf. Syst. 61(2): 847-871 (2019)
• 
  Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier:
  On Graphs with Minimal Eternal Vertex Cover Number. CALDAM 2019: 263-273
• 
  Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis, Viktor Zamaraev:
  How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? ICALP 2019: 131:1-131:14
• 
  Jiawen Sun, Hans Vandierendonck, Dimitrios S. Nikolopoulos:
  VEBO: a vertex- and edge-balanced ordering heuristic to load balance parallel graph processing. PPoPP 2019: 391-392
• 
  Michael Capalbo:
  Explicit N-vertex graphs with maximum degree K and diameter [1+o(1)] log_K-1 N for each K-1 a prime power. STOC 2019: 1191-1202
• 
  Yanamandram B. Venkatakrishnan, H. Naresh Kumar:
  On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs. WALCOM 2019: 188-198
• 
  Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis, Viktor Zamaraev:
  How fast can we reach a target vertex in stochastic temporal graphs? CoRR abs/1903.03636 (2019)
• 
  Ranveer Singh, Cheng Zheng, Naomi Shaked-Monderer, Abraham Berman:
  Nonsingular (Vertex-Weighted) Block Graphs. CoRR abs/1905.01921 (2019)
• 
  Xin Zhang, Bei Niu, Yan Li, Bi Li:
  Equitable vertex arboricity of $d$-degenerate graphs. CoRR abs/1908.05066 (2019)
• 
  Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
  Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex. CoRR abs/1910.07950 (2019)
• 2018
• 
  Pu Wu, Zehui Shao, Enqiang Zhu, Huiqin Jiang, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami:
  Independent Roman Domination Stable and Vertex-Critical Graphs. IEEE Access 6: 74737-74746 (2018)
• 
  David Brandfonbrener, Pat Devlin, Netanel Friedenberg, Yuxuan Ke, Steffen Marcus, Henry Reichard, Ethan Sciamma:
  Two-Vertex Generators of Jacobians of Graphs. Electr. J. Comb. 25(1): P1.15 (2018)
• 
  Nilanjan De:
  Vertex weighted Laplacian Energy of union of graphs. The Computer Science Journal of Moldova 26(1): 29-38 (2018)
• 
  Jonathan Baker, Kevin N. Vander Meulen, Adam Van Tuyl:
  Shedding vertices of vertex decomposable well-covered graphs. Discrete Mathematics 341(12): 3355-3369 (2018)
• 
  S. Akbari, N. Alipourfard, P. Jandaghi, M. Mirtaheri:
  On N2-vertex coloring of graphs. Discrete Math., Alg. and Appl. 10(1): 1-7 (2018)
• 
  Shunsuke Nakamura, Yoshimi Egawa, Keiko Kotani:
  Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph. Electronic Notes in Discrete Mathematics 68: 23-28 (2018)
• 
  Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
  2-vertex connectivity in directed graphs. Inf. Comput. 261(Part): 248-264 (2018)
• 
  Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Abdelhakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
  Tropical dominating sets in vertex-coloured graphs. J. Discrete Algorithms 48: 27-41 (2018)
• 
  Francesco Grassi, Andreas Loukas, Nathanaël Perraudin, Benjamin Ricaud:
  A Time-Vertex Signal Processing Framework: Scalable Processing and Meaningful Representations for Time-Series on Graphs. IEEE Trans. Signal Processing 66(3): 817-829 (2018)
• 
  Francesco Parisi, Noseong Park, Andrea Pugliese, V. S. Subrahmanian:
  Top-k User-Defined Vertex Scoring Queries in Edge-Labeled Graph Databases. TWEB 12(4): 21:1-21:35 (2018)
• 
  Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, Hong Phong Pham:
  Maximum Colorful Cliques in Vertex-Colored Graphs. COCOON 2018: 480-491
• 
  Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, Hong Phong Pham:
  Maximum Colorful Cycles in Vertex-Colored Graphs. CSR 2018: 106-117
• 
  Nina Engelhardt, C.-H. Dominic Hung, Hayden Kwok-Hay So:
  Performance-Driven System Generation for Distributed Vertex-Centric Graph Processing on Multi-FPGA Systems. FPL 2018: 215-218
• 
  Jiawen Sun, Hans Vandierendonck, Dimitrios S. Nikolopoulos:
  VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing. CoRR abs/1806.06576 (2018)

skipping 192 more matches

found ?? matches

The Semantic Scholar full-text search requires JavaScript to operate properly. To proceed, please enable JavaScript in your browser settings.

• service temporarily not available

see all matches at semanticscholar.org