Graphs

Results: 4392



#Item
281

S´eminaire de Master 2`eme ann´ee Sous la direction de Thomas Blossier C´edric Milliet — 1er d´ecembre 2004 Extending partial isomorphisms of finite graphs

Add to Reading List

Source URL: math.univ-lyon1.fr

- Date: 2009-12-20 09:30:30
    282

    On Testing Expansion in Bounded-Degree Graphs Oded Goldreich and Dana Ron Abstract. We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the

    Add to Reading List

    Source URL: www.wisdom.weizmann.ac.il

    - Date: 2010-07-22 08:07:03
      283

      JMLR: Workshop and Conference Proceedings vol–22 Polynomial Time Optimal Query Algorithms for Finding Graphs with Arbitrary Real Weights Sung-Soon Choi

      Add to Reading List

      Source URL: jmlr.org

      - Date: 2013-06-18 21:17:28
        284

        The Integrated PSOA RuleML for Interoperating SQL Relations and SPARQL Graphs Harold Boley, Faculty of Computer Science, University of New Brunswick, Canada The 6th Atlantic Workshop on Semantics and Services (AWoSS 2015

        Add to Reading List

        Source URL: www.cs.unb.ca

        - Date: 2015-12-08 22:25:52
          285

          Andries E. Brouwer, Willem H. Haemers Spectra of graphs – Monograph – February 1, 2011

          Add to Reading List

          Source URL: www.win.tue.nl

          - Date: 2011-02-04 06:33:32
            286

            3D Proportional Contact Representations of Graphs Md. Jawaherul Alam∗ , Stephen G. Kobourov∗ , Giuseppe Liotta† , Sergey Pupyrev∗ and Sankar Veeramoni∗ ∗ †

            Add to Reading List

            Source URL: www.cs.arizona.edu

              287

              Distributed Programming over Time-series Graphs Yogesh Simmhan, Neel Choudhury Charith Wickramaarachchi, Alok Kumbhare, Marc Frincu, Cauligi Raghavendra, Viktor Prasanna

              Add to Reading List

              Source URL: serc.iisc.ernet.in

              - Date: 2014-11-03 07:29:02
                288

                Dynamic Object Process Graphs Jochen Quante, Rainer Koschke University of Bremen, Germany http://www.informatik.uni-bremen.de/st/ {quante, koschke}@informatik.uni-bremen.de

                Add to Reading List

                Source URL: www.informatik.uni-bremen.de

                - Date: 2006-03-24 06:06:37
                  289

                  Rank-width and tree-width of H-minor-free graphs

                  Add to Reading List

                  Source URL: users.uoa.gr

                  - Date: 2014-06-11 17:30:33
                    290

                    Are Crossings Important for Drawing Large Graphs? Stephen G. Kobourov, Sergey Pupyrev, Bahador Saket Department of Computer Science, University of Arizona, Tucson, AZ, USA Abstract. Reducing the number of edge crossings

                    Add to Reading List

                    Source URL: www.cs.arizona.edu

                      UPDATE