533 research outputs found

    Randomized Speedup of the Bellman-Ford Algorithm

    Full text link
    We describe a variant of the Bellman-Ford algorithm for single-source shortest paths in graphs with negative edges but no negative cycles that randomly permutes the vertices and uses this randomized order to process the vertices within each pass of the algorithm. The modification reduces the worst-case expected number of relaxation steps of the algorithm, compared to the previously-best variant by Yen (1970), by a factor of 2/3 with high probability. We also use our high probability bound to add negative cycle detection to the randomized algorithm.Comment: 12 Pages, 6 Figures, ANALCO 201

    Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth

    Full text link
    We investigate crossing minimization for 1-page and 2-page book drawings. We show that computing the 1-page crossing number is fixed-parameter tractable with respect to the number of crossings, that testing 2-page planarity is fixed-parameter tractable with respect to treewidth, and that computing the 2-page crossing number is fixed-parameter tractable with respect to the sum of the number of crossings and the treewidth of the input graph. We prove these results via Courcelle's theorem on the fixed-parameter tractability of properties expressible in monadic second order logic for graphs of bounded treewidth.Comment: Graph Drawing 201

    Fixed parameter tractability of crossing minimization of almost-trees

    Full text link
    We investigate exact crossing minimization for graphs that differ from trees by a small number of additional edges, for several variants of the crossing minimization problem. In particular, we provide fixed parameter tractable algorithms for the 1-page book crossing number, the 2-page book crossing number, and the minimum number of crossed edges in 1-page and 2-page book drawings.Comment: Graph Drawing 201

    Small Superpatterns for Dominance Drawing

    Full text link
    We exploit the connection between dominance drawings of directed acyclic graphs and permutations, in both directions, to provide improved bounds on the size of universal point sets for certain types of dominance drawing and on superpatterns for certain natural classes of permutations. In particular we show that there exist universal point sets for dominance drawings of the Hasse diagrams of width-two partial orders of size O(n^{3/2}), universal point sets for dominance drawings of st-outerplanar graphs of size O(n\log n), and universal point sets for dominance drawings of directed trees of size O(n^2). We show that 321-avoiding permutations have superpatterns of size O(n^{3/2}), riffle permutations (321-, 2143-, and 2413-avoiding permutations) have superpatterns of size O(n), and the concatenations of sequences of riffles and their inverses have superpatterns of size O(n\log n). Our analysis includes a calculation of the leading constants in these bounds.Comment: ANALCO 2014, This version fixes an error in the leading constant of the 321-superpattern siz

    Land tenure and the adoption of agricultural technology in Haiti:

    Get PDF
    There has long been an active debate in Haiti - as in many other developing countries - over whether or not the customary tenure system constrains technology adoption and agricultural development, and whether cadaster and land titling should be national priorities. This paper contributes to this debate by reviewing and interpreting the body of literature and new empirical evidence concerning the relationship between land tenure and the adoption of technology in rural Haiti. The findings suggest that (a) formal title is not necessarily more secure than informal arrangements, (b) informal arrangements based on traditional social capital resources assure affordable and flexible access to land for most people, and (c) perceived stability of access to land-via stability of personal and social relationships-is a more important determinant of technology adoption than mode of access. The paper concludes that there is no definitive relationship between tenure and technology adoption by peasants; peasants are preoccupied more by political and economic insecurity than insecure tenure; and rather than tinkering with formalizing tenure, policy makers should prioritize other more fundamental rural sector reforms. The paper ends by considering some of the implications for theory and suggests several avenues for future research on land policy.

    The Form of the Content: The Digital Archive Nahuatl/Nawat in Central America

    Get PDF
    The digital archive “Nahuatl/Nawat in Central America” (NECA) assembles and makes publicly available a growing corpus of Nahuan-language documents produced in Spanish Central America. Many are fragments within larger Spanish-language documents and difficult to locate in the archive. NECA has succeeded in bringing attention to this understudied corpus but has so far failed to attract users to its transcription and translation tool. We consider the reasons for this creative failure based on user data, and suggest that the specialized skills and distinct academic communities needed to move this project forward require other workspaces, including the non-digital, in advance of online collaboration
    • …
    corecore