We describe algorithms for drawing media, systems of states, tokens and actions that have state transition graphs in the form of partial cubes. Our algorithms are based on two prin...
Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for des...
Vijay Lakamraju, Zahava Koren, Israel Koren, C. Ma...
In embedded software development, the programming language C and inline assembly code are traditionally widely used. However, tools for C program-understanding, e.g., cross-refere...
Katsuhiko Gondow, Tomoya Suzuki II, Hayato Kawashi...
The tree-based languages XQuery and XSLT for XML are widely supported. Many tools do not yet support the new RDF graph query language SPARQL. We propose to embed SPARQL subqueries...
Sven Groppe, Jinghua Groppe, Volker Linnemann, Dir...
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...