Graph

Results: 12817



#Item
341

Asynchronous Large-Scale Graph Processing Made Easy Guozhang Wang, Wenlei Xie, Alan Demers, Johannes Gehrke Cornell University Ithaca, NY {guoz,

Add to Reading List

Source URL: www.cs.cornell.edu

- Date: 2012-12-02 10:26:09
    342

    Introduction Combined Interoperation/Portability Methods Use Cases A Translator Framework for the Interoperation of Graph plus Relational Data and Rules

    Add to Reading List

    Source URL: www.cs.unb.ca

    - Date: 2014-03-03 13:07:02
      343

      Benchmarking for Graph Transformation∗ Gergely Varr´o Department of Computer Science and Information Theory Budapest University of Technology and Economics Magyar tud´osok k¨or´utja 2. H-1521 Budapest, Hungary

      Add to Reading List

      Source URL: www.cs.bme.hu

      - Date: 2005-09-05 17:08:27
        344

        Happy Edges: Threshold-Coloring of Regular Lattices Md. J. Alam, S. G. Kobourov, S. Pupyrev, and J. Toeniskoetter Department of Computer Science, University of Arizona, Tucson, USA Abstract. We study a graph coloring pro

        Add to Reading List

        Source URL: www.cs.arizona.edu

        - Date: 2014-03-18 00:08:28
          345

          Grailog 1.0: Graph-Logic Visualization of Ontologies and Rules Harold Boley National Research Council, Security and Disruptive Technologies University of New Brunswick, Faculty of Computer Science Fredericton, NB, Canada

          Add to Reading List

          Source URL: www.cs.unb.ca

          - Date: 2013-05-12 19:46:42
            346

            Conflict-Directed Graph Coverage Daniel Schwartz-Narbonne1 , Martin Sch¨af2 , Dejan Jovanovi´c2 , Philipp R¨ ummer3 , and Thomas Wies1 1

            Add to Reading List

            Source URL: cs.nyu.edu

            - Date: 2015-02-11 13:57:46
              347

              An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Graph Algorithms in Bioinformatics

              Add to Reading List

              Source URL: bix.ucsd.edu

              - Date: 2008-01-08 10:44:19
                348

                Graph games with perfect information Dietmar Berwanger∗ MPRI

                Add to Reading List

                Source URL: www.lsv.fr

                - Date: 2013-02-21 07:55:45
                  349

                  The Sandwich Theorem Donald E. Knuth Abstract: This report contains expository notes about a function ϑ(G) that is popularly known as the Lov´ asz number of a graph G. There are many ways to define ϑ(G), and the surpr

                  Add to Reading List

                  Source URL: www.emis.de

                  - Date: 1998-07-27 15:54:10
                    350

                    SEARCHING FOR A VISIBLE, LAZY FUGITIVE∗ DAVID RICHERBY† AND DIMITRIOS M. THILIKOS‡ Abstract. Graph searching problems are described as games played on graphs, between a set of cops and a fugitive. Variants of the g

                    Add to Reading List

                    Source URL: users.uoa.gr

                    - Date: 2014-06-11 17:30:30
                      UPDATE