Deriving a class of layer-oriented graph algorithms
Identifieur interne : 00BF60 ( Main/Exploration ); précédent : 00BF59; suivant : 00BF61Deriving a class of layer-oriented graph algorithms
Auteurs : Martin Russling [Allemagne]Source :
- Science of Computer Programming [ 0167-6423 ] ; 1996.
English descriptors
- Teeft :
- Algebra, Algorithm, Algorithm scheme, Arity, Binary relations, Boolean values, Computer programming, Computer science, Conditional expressions, Deductive databases, Different problems, Empty word, Finite vertex, Formal languages, General scheme, Graph algorithms, Graph traversal, Kloster irsee, Lecture notes, Lowest priority, Natural numbers, Nullary relations, Path closure, Path lengths, Pointwise, Proc, Program construction, Programming, Programming languages, Reachability problem, Recursion, Regular algebra, Russling, Russling iscience, Special case, Springer, Subset, Theoretic operations, Traversal, Uniform treatment, Vertex sequences.
Abstract
Abstract: We survey an algebra of formal languages suitable to deal with graph algorithms. As an example of its use we derive a general scheme for layer-oriented graph traversal. This general scheme is then applied to a reachability and a shortest path problem.
Url:
DOI: 10.1016/0167-6423(95)00030-5
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001532
- to stream Istex, to step Curation: 001514
- to stream Istex, to step Checkpoint: 002861
- to stream Main, to step Merge: 00C781
- to stream Main, to step Curation: 00BF60
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Deriving a class of layer-oriented graph algorithms</title>
<author><name sortKey="Russling, Martin" sort="Russling, Martin" uniqKey="Russling M" first="Martin" last="Russling">Martin Russling</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:5BF745994B9BEC83F86D7100372995677E34C984</idno>
<date when="1996" year="1996">1996</date>
<idno type="doi">10.1016/0167-6423(95)00030-5</idno>
<idno type="url">https://api.istex.fr/ark:/67375/6H6-R2SCH70Q-9/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001532</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001532</idno>
<idno type="wicri:Area/Istex/Curation">001514</idno>
<idno type="wicri:Area/Istex/Checkpoint">002861</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002861</idno>
<idno type="wicri:doubleKey">0167-6423:1996:Russling M:deriving:a:class</idno>
<idno type="wicri:Area/Main/Merge">00C781</idno>
<idno type="wicri:Area/Main/Curation">00BF60</idno>
<idno type="wicri:Area/Main/Exploration">00BF60</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a">Deriving a class of layer-oriented graph algorithms</title>
<author><name sortKey="Russling, Martin" sort="Russling, Martin" uniqKey="Russling M" first="Martin" last="Russling">Martin Russling</name>
<affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Lehrstuhl für Informatik II, Universität Augsburg, D-86135 Augsburg</wicri:regionArea>
<placeName><region type="land" nuts="1">Bavière</region>
<region type="district" nuts="2">District de Souabe</region>
<settlement type="city">Augsbourg</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Science of Computer Programming</title>
<title level="j" type="abbrev">SCICO</title>
<idno type="ISSN">0167-6423</idno>
<imprint><publisher>ELSEVIER</publisher>
<date type="published" when="1996">1996</date>
<biblScope unit="volume">26</biblScope>
<biblScope unit="issue">1–3</biblScope>
<biblScope unit="page" from="117">117</biblScope>
<biblScope unit="page" to="132">132</biblScope>
</imprint>
<idno type="ISSN">0167-6423</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0167-6423</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Algebra</term>
<term>Algorithm</term>
<term>Algorithm scheme</term>
<term>Arity</term>
<term>Binary relations</term>
<term>Boolean values</term>
<term>Computer programming</term>
<term>Computer science</term>
<term>Conditional expressions</term>
<term>Deductive databases</term>
<term>Different problems</term>
<term>Empty word</term>
<term>Finite vertex</term>
<term>Formal languages</term>
<term>General scheme</term>
<term>Graph algorithms</term>
<term>Graph traversal</term>
<term>Kloster irsee</term>
<term>Lecture notes</term>
<term>Lowest priority</term>
<term>Natural numbers</term>
<term>Nullary relations</term>
<term>Path closure</term>
<term>Path lengths</term>
<term>Pointwise</term>
<term>Proc</term>
<term>Program construction</term>
<term>Programming</term>
<term>Programming languages</term>
<term>Reachability problem</term>
<term>Recursion</term>
<term>Regular algebra</term>
<term>Russling</term>
<term>Russling iscience</term>
<term>Special case</term>
<term>Springer</term>
<term>Subset</term>
<term>Theoretic operations</term>
<term>Traversal</term>
<term>Uniform treatment</term>
<term>Vertex sequences</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We survey an algebra of formal languages suitable to deal with graph algorithms. As an example of its use we derive a general scheme for layer-oriented graph traversal. This general scheme is then applied to a reachability and a shortest path problem.</div>
</front>
</TEI>
<affiliations><list><country><li>Allemagne</li>
</country>
<region><li>Bavière</li>
<li>District de Souabe</li>
</region>
<settlement><li>Augsbourg</li>
</settlement>
</list>
<tree><country name="Allemagne"><region name="Bavière"><name sortKey="Russling, Martin" sort="Russling, Martin" uniqKey="Russling M" first="Martin" last="Russling">Martin Russling</name>
</region>
<name sortKey="Russling, Martin" sort="Russling, Martin" uniqKey="Russling M" first="Martin" last="Russling">Martin Russling</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00BF60 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00BF60 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:5BF745994B9BEC83F86D7100372995677E34C984 |texte= Deriving a class of layer-oriented graph algorithms }}
This area was generated with Dilib version V0.6.33. |