Graph

Results: 12817



#Item
501

Algorithms and Data Structures (WS15/16) Example Solutions for Units 29 & 30 Problem 1 In graph theory, an orientation of an undirected graph is an assignment of a direction to each edge, turning the initial graph into a

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

- Date: 2016-03-23 14:38:31
    502

    Graph Model Based Indoor Tracking Christian S. Jensen† Hua Lu† Bin Yang†‡ † Department of Computer Science, Aalborg University, Denmark ‡ School of Computer Science, Fudan University, China

    Add to Reading List

    Source URL: people.cs.aau.dk

    - Date: 2009-02-27 04:43:54
      503

      Routing on the Dependency Graph: A New Approach to Deadlock-Free High-Performance Routing Jens Domke Torsten Hoefler

      Add to Reading List

      Source URL: htor.inf.ethz.ch

      - Date: 2016-04-15 13:23:01
        504

        Segmentation of Sub-Cortical Structures by the Graph-Shifts Algorithm Jason J. Corso1 , Zhuowen Tu1 , Alan Yuille2 , and Arthur Toga1 1 Center for Computational Biology

        Add to Reading List

        Source URL: pages.ucsd.edu

        - Date: 2007-01-31 16:47:00
          505

          1st Draft, written very quickly. May contain errors. Be aware. Stephen P. Borgatti Graph Theory

          Add to Reading List

          Source URL: www.analytictech.com

          - Date: 2015-10-12 19:12:55
            506

            Finding vertex-surjective graph homomorphisms? Petr A. Golovach1 , Bernard Lidick´ y2 , 1 Barnaby Martin , and Dani¨el Paulusma1

            Add to Reading List

            Source URL: orion.math.iastate.edu

            - Date: 2014-08-22 14:44:47
              507

              Scalable k-NN graph construction for visual descriptors∗ Jing Wang† Jingdong Wang‡ Gang Zeng† Zhuowen Tu‡ § Rui Gan† Shipeng Li‡ † Peking University ‡Microsoft Research Asia § Lab of Neuro Imaging and

              Add to Reading List

              Source URL: pages.ucsd.edu

              - Date: 2012-04-22 00:59:49
                508

                The Vapnik-Chervonenkis Dimension of a Random Graph Martin Anthony∗ Graham Brightwell†

                Add to Reading List

                Source URL: www.maths.lse.ac.uk

                - Date: 2000-04-03 14:32:33
                  509

                  Algorithms and Data Structures Winter TermExercises for Units 29 & 30 1. Let G = (V, E) be an undirected graph with vertices V = {v1 , . . . , vn }. Give an efficient algorithm that, given a sequence of non-nega

                  Add to Reading List

                  Source URL: www-tcs.cs.uni-sb.de

                  - Date: 2016-03-21 12:46:57
                    510

                    On-line Hierarchical Graph Drawing Stephen C. North and Gordon Woodhull north, AT&T Labs - Research 180 Park Ave. Bldg. 103 Florham Park, New JerseyU.S.A.)

                    Add to Reading List

                    Source URL: www.research.att.com

                    - Date: 2009-11-17 10:55:59
                      UPDATE